In which data structure, elements can be added or removed at
either end, but not in the middle?
Answer Posted / swapna
its the doubly ended queue...
| Is This Answer Correct ? | 22 Yes | 0 No |
Post New Answer View All Answers
What is red black tree in data structure?
What is the meaning of arraylist?
How does a heap sort work?
Will arraylist maintain insertion order?
Explain the implementation of an AVL tree and Binary tree.
Have you ever used HashTable and Directory?
What is insertion sort technique?
Where will be the free node available while inserting a new node in a linked list?
What are sorting algorithms used for?
What is immutablelist?
Where the data structures are used?
What is meant by balanced binary tree?
What is stable sort example?
State the rules to be followed during infix to prefix conversions?
What exactly is a thread?