In which data structure, elements can be added or removed at
either end, but not in the middle?
Answer Posted / saran
deque is the correct one because the elments can be added or removed in both direction ie front and rear.......
but not in the middle
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Which is the parent class of list
What is meant by arraylist?
What is difference between hashset and linkedhashset?
Is hashmap faster than arraylist?
Who invented data structure?
How do you find the size of an arraylist?
List the abstract operations in the set?
Is set sorted?
Explain the most efficient method to reverse a linked list?
List the basic operations carried out in a linked list?
Describe the level term in a tree.
What is data type and its types?
What are splay trees?
What is the difference between hashset and arraylist?
Define ancestor and descendant ?