Interested to Buy Any Domain ? << Click Here >> for more details...
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 sort of serious problems have you experienced, and how have you handled them?
Give us a program to reverse a linked list.
What do you mean by double hashing?
What is sorting in math?
What are the advantages and disadvantages of copyonwritearraylist?
What are trees in data structures?
Explain about circular linked list?
Is array of data structure?
Which is faster array or linked list?
Define the tree data structure.
What is max heapify?
Are data structures important?
Why is reflection slower?
Define an algorithm.
What is linear-logarithm chasm?
