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 is dynamic array with example?
What is the difference between hashmap and arraylist?
Write the disadvantages of separate chaining?
State the difference between persistent and ephemeral data structure?
Does the minimal spanning tree of a graph give the shortest distance between any 2 specified nodes?
What is a Stack? Explain with example?
Which searching algorithm is best?
Which is the parent class of linkedlist class?
Which data structure is used in arraylist?
Can we declare array size as a negative number?
What is time complexity of arrays sort?
Is map a collection?
What is data structure and its types?
Which language is best for data structures and algorithms?
What is data structure and why we need it?
