Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / avanesh singh
D-queue is a special type of data structure in which insertions and deletions will be done either at the front end or at the rear end of the queue.
The operations that can be performed on deques are-:
· Insert an item from front end.
· Insert an item from rear end.
· Delete an item from front end.
· Delete an item from rear end.
· Display the contents of queue.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Is array a data structure?
What is an algorithm in coding?
What is a string or array type?
How do you represent a linked list?
Define level of the tree?
What are the collision resolution methods?
Write a program to insert an element and in the specific position in the array?
How efficient is binary search?
Which is faster array or linked list?
How does a heap sort work?
Does set allow null values?
What is an object array?
What is difference between linear and non linear data structure?
Which sorting algorithm is best for large data?
How many types of search algorithms are there?
