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 the difference between binary tree and binary search tree?
What are different sorting algorithms?
Can you override methods of arraylist?
Describe tree database. Explain its common uses.
What package is arraylist?
What are the different data structures?
How does insertion sort works?
What are the disadvantages of linked list over array?
How to search binary in a sorted array?
Why is concurrenthashmap thread safe?
Why is map not a collection?
Does treemap allow null values?
Name few classes that implement collection interface?
How to print element of Array?
By Which algorithm, the 8 queens problem is solved?
