In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 94565 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 is the space complexity of selection sort?
What is the difference between arraylist and hashmap?
Is quicksort greedy algorithm?
How can I search for data in a linked list?
Can treeset have duplicates?
What is time and space complexity of bubble sort?
What is peek in stack?
Differentiate between hashmap and treemap.
Explain binary representation?
Define 2-3 tree?
What is a treemap used for?
What is an acyclic graph?
Is array a data structure?
Why do we need algorithm?
What happens if we try to insert duplicate key in hashmap?
