In which data structure, elements can be added or removed at
either end, but not in the middle?
Answer Posted / pavan
Deque
| Is This Answer Correct ? | 43 Yes | 1 No |
Post New Answer View All Answers
What is definition list?
How can a binary tree be represented using the rotation?
Can I provide array size dynamically?
Which time complexity is best?
Define open addressing?
Define 2-3-4 tree?
If you are given a choice to use either arraylist and linkedlist, which one would you use and why?
What is the Role of push() and pop() method?
What is a stable sorting algorithm?
State the merit of linked representation of binary trees?
Explain the term binding time?
How many types of linked lists are there?
State the advantages of using infix notations?
Can we store null in arraylist?
Why do we need linked lists?