Answer Posted / vinuthna
A deque is a abstract data structure that implements a queue
for which elements can be added to front or rear and the
elements can be removed from the rear or front.
it is also called head-tail linked list
| Is This Answer Correct ? | 77 Yes | 2 No |
Post New Answer View All Answers
What is queue in data structure?
What is an object array?
Define a right-skewed binary tree?
What is an externalizable interface?
Explain the term base case?
What is insertion sort technique?
Is radix sort stable?
What does sorting an array do?
You want to insert a new item in a binary search tree. How would you do it?
List some applications of tree-data structure?
How to find the missing element in integer array of 1 to 7?
Explain what is the bucket size, when the overlapping and collision occur at same time?
Is treemap sorted?
Define shortest path?
Differentiate between failfast and failsafe.