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
Can sets contain duplicates?
Differentiate between singly and doubly linked lists?
What is frozenset?
What is the difference between hashset and treeset?
Does hashmap maintain insertion order?
What is complete binary tree in data structure?
What is a 2 dimensional array?
Is boolean a data type?
What does adt stands for?
Can treemap have duplicate values?
How do you find the index of an element in an arraylist?
What are the advantages of modularity?
Give a basic algorithm for searching a binary search tree?
Will this code give error if I try to add two heterogeneous elements in the arraylist? And why?
What is dynamic array how it is created?
