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
What's the difference between an array and vector?
Which interfaces are implemented by abstractsequentiallist?
What sorting algorithm should be used for sorting strings?
How to sort 1 million floating point numbers?
What is an ordered map?
Explain the principle of quicksort. What is its complexity?
What is breadth first tree?
Can you use Bubble Sort To sort the number of elements.
Which collection type is used to maintain uniqueness of data structure?
Does hashmap maintain insertion order?
Give us a program to reverse a linked list.
How can you correct these errors?
Define articulation point?
Can we define the size of arraylist?
What is a graph?