Interested to Buy Any Domain ? << Click Here >> for more details...
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
Write a Program for Insert in a sorted list
Is hashset a collection?
Can we put null key in hashmap?
What is difference between tree and forest?
What is meant by heap sort?
What are the two traversal strategies used in traversing a graph?
Why is it called bubble sort?
What is data and information explain with example?
Why is arraylist faster than linkedlist?
What are the advantages of merge sort?
Explain merge sort algorithms.
Differentiate between push and pop?
What type of memory allocation is referred for Linked lists?
Tell us the difference between merge and quick sort. Which one would you prefer and why?
What do you mean by tree edge?
