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
Explain recursive function & what is the data structures used to perform recursion?
What is subtree?
What is meant by binary tree traversal?
What is raid (redundant array of inexpensive disks)?
What are the advantages and disadvantages of linked list?
Define data type and what are the types of data type?
What is meant by linked list?
What is priority queue in data structure?
Why is sorting and classifying important?
Can we create a null as a key for a map collection?
For addition and deletion. Which one is most preferred: array list or linked list?
Why is quicksort so fast?
What is concept of data structure?
Can you store different types in an array?
Why you need a data structure?
