Answer Posted / baskar
d-queue stands for double ended queue.we can add & delete
elements at either side.they are two other variations like
input restricted deque and output restricted deque.
Input restricted deque means we can delete at both end
but insert only at end of the queue(ie) rear .
Output restricted deque means we can insert at both end
but delete only at end of the queue(ie)front.
| Is This Answer Correct ? | 30 Yes | 2 No |
Post New Answer View All Answers
How do you separate zeros from non-zeros in an array?
What is the similarity between a Structure, Union and enumeration?
How does a treemap work?
What is the difference between a Stack and a Queue.
What is static array?
How can a binary tree be represented using the rotation?
What is heap tree in data structure?
Which sorting is worst?
What are the different types of data structures?
What is mean by merge sort?
How many types of search algorithms are there?
Explain Array of pointers?
How can I learn data structures?
Can we null keys in treemap?
What are threaded binary trees?
