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
Is char array null terminated?
What is data in computer science?
Is hashmap sorted?
What is the default size of an arraylist?
Is hashmap faster than arraylist?
Can hashset contain duplicates?
Can sets contain duplicates?
What do you mean by balanced trees?
Write a Program for Reverse a linked list.
What is difference between list and linked list?
What data type is enum?
What is peep stack?
Define path in a graph?
Which sorting technique is faster?
Why is data structure used?