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
What is numeric array?
What is the difference between an array and vector?
How can we reverse a singly linked list?
how to delete first node from singly linked list?
Explain the uses of binary tree.
What do you mean by probing?
What is a reverse linked list.
Devise a program to sort an array using bubble sort.
What is declaring array?
Is hashmap a data structure?
You are given a singly linked list. How would you find out if it contains a loop or not without using temporary space?
What do you mean by the term “percolate down”?
Differentiate between iterator and listiterator.
Explain the Complete structure of hashmap along with the basic coding of the hashmap internal implementation.
What are the different types of linked list?
