In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 94820 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / bhasu
dequeues is the correct
| Is This Answer Correct ? | 10 Yes | 4 No |
Post New Answer View All Answers
Explain implementation of traversal of a binary tree.
What is difference between hashmap and treemap?
What data structure does a binary tree degenerate?
Why insertion is faster in linked list?
What are the advantages of data structure?
How do you find the number of comparisons in bubble sort?
What is the difference between a push and a pop?
what is Linked lists?
What sort of serious problems have you experienced, and how have you handled them?
How can avl tree be useful in all the operations as compared to binary search tree?
What is the minimization factor and time complexity of b-tree?
What do you mean by garbage collection?
What happens when arraylist is full?
What are the differences between b tree and b+ tree?
Can we add duplicate keys in a hashmap? What will happen if we attempt to add duplicate values?
