Answer Posted / sudhir & kranti
It is one of the special variation of queue which allows the elements to be inserted and removed at both ends (rear and front) but not at middle.
De-queue can be of 2 types
i)Input restricted de-queue: elements can be removed at both ends but insertion at one end.
ii)Output restricted de-queue: elements can be inserted at both ends but deletion at one end.
| Is This Answer Correct ? | 1 Yes | 1 No |
Post New Answer View All Answers
Why is treeset sorted?
What is binary search in data structure?
Can you have an arraylist of arrays?
Explain merge sort algorithms.
Is red black tree balanced?
What is a subtree in data structures?
What should I learn first data structures or algorithms?
What is the difference between hashset and treeset?
How do I remove a value from a list?
Why is sorting important?
What is the difference between an array and vector?
What are the two types of data?
Can arraylist shrink?
Why do we use insertion sort?
What is the difference between a hashmap and hashtable?
