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 inplace sorting?
How to inverting a function in sort and searching?
What are the collision resolution methods?
Why do we use a multidimensional array in data structure?
Mention some drawbacks of the linked list.
Which searching algorithm is best?
Who created quicksort?
Is treemap thread safe?
How would you implement two stacks using a single array?
Can hashset contain null?
Describe the degree term in a tree.
When would you use a tuple?
What are three common types of traversals?
What is structured data with example?
Treemap orders the elements on which field?
