Interested to Buy Any Domain ? << Click Here >> for more details...
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 collection class is thread safe?
When will you use array over arraylist?
What are the topics in data structures?
Does hashmap maintain insertion order?
What is Another name of Dynamically allocating memory.
List the data structures which are used in network data modal.
What is the difference between for and foreach loop?
Why do we use trees in data structures?
What is complete binary tree and almost complete binary tree?
What is an acyclic graph?
What is array and its types in data structure?
How would you swap the Kth node from beginning with Kth node from end in a Linked List.
Why do we use a multidimensional array in data structure?
What is meant by linked list?
Are linked lists useful?
