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 sorting and classifying important?
What do you know about the big-o notation and can you give some examples with respect to different data structures?
Does stringutils isempty check for null?
Which language is best for learning data structures and algorithms?
What is the difference between hashmap and treemap?
How does hashset maintain order?
In what order the elements of a hashset are retrieved?
Define linear probing?
Are duplicates allowed in hashmap?
What is a cycle or a circuit?
What is subtree?
What are the different types of collections?
How to create your own data structure in java?
Describe what is Node in link list? And name the types of Linked Lists?
What is heap tree explain with example?
