Answer Posted / avanesh singh
D-queue is a special type of data structure in which insertions and deletions will be done either at the front end or at the rear end of the queue.
The operations that can be performed on deques are-:
· Insert an item from front end.
· Insert an item from rear end.
· Delete an item from front end.
· Delete an item from rear end.
· Display the contents of queue.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is the need for extendible hashing?
What do you mean by 2-3-4 tree?
List out the basic operations that can be performed on a stack?
Can value be null in treemap?
Explain the priority queue?
What are the advantages of binary search over linear search?
Can arraylist have null values?
What is a string array?
What do you mean by priority queue?
What is the difference between collections class vs collections interface?
Can you have an arraylist of arrays?
What is the difference between the hash table and hash map?
What is difference between rb tree and avl tree?
Define the term “percolate down”?
Name few collections map implementations?
