In which data structure, elements can be added or removed at
either end, but not in the middle?
Answer Posted / loveleen kaur
a deque is a linear list in which elements can be added or
removed at either end but not in the middle..it is the
contraction of name double ended queue..
| Is This Answer Correct ? | 3 Yes | 1 No |
Post New Answer View All Answers
Can we null keys in treemap?
What does stack top do?
How does dynamic memory allocation help in managing data?
What is hashing in cyber security?
Define depth and height of a tree?
What is the most used data structure?
Can we remove element from arraylist while iterating?
Does hashset allow duplicates?
Is quicksort a stable sorting algorithm?
What is fibonacci search?
Sorting is not possible by using which of the methods?
There is a program which inserts and deletes node in a sorted singly linked list. There is a bug in one of the modules, how would you debug it?
Is arraylist reference type?
What is a Stack? Explain with example?
What is the best sorting technique?