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
Which interfaces are implemented by hashmap?
Why insertion is faster in linked list?
Does the minimal spanning tree of a graph give the shortest distance between any 2 specified nodes?
Why do we need to recycle?
State the difference between persistent and ephemeral data structure?
Why are b trees used?
Are linked lists considered linear or non-linear data structures?
What are the different types of data structures explain briefly?
What are the tasks performed during postorder traversal?
What is the difference between a Stack and a Queue.
How does a binary search work?
Explain the expression trees?
Define non-linear data structures?
Give a good data structure for having n queues ( n not fixed) in a finite memory segment. You can have some data-structure separate for each queue. Try to use at least 90% of the memory space.
What does the dummy header in linked list contain?
