Interested to Buy Any Domain ? << Click Here >> for more details...
In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 106967 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / achintya shankar adhikari
it must b DEQUEUE,where elements can be added or removed at
either end,but not from the middle end..
| Is This Answer Correct ? | 25 Yes | 3 No |
Post New Answer View All Answers
What exactly is data?
How would you sort words in a large file?
Traverse the given tree using Inorder, Preorder and Postorder traversals. Inorder : D H B E A F C I G J Preorder: A B D H E C F G I J Postorder: H D E B F I J G C A
What is adt example?
Define a binary search tree?
Describe linear probing with an example.
What is complete binary tree in data structure?
What are linked lists good for?
How dynamic arrays are created?
How do you sort a list in reverse order?
Why is data structure?
Explain implementation of deletion from a binary tree.
Where is binary tree used?
Write program for Quick sort ?
What is bubble sort in data structure?
