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
Why do we use a multidimensional array in data structure?
Explain multiply linked list in short.
What is meant by linked list?
What is data algorithm?
Run time memory allocation is known as in data structure?
Model a data structure for a DFA that takes an event as parameter and performs a desired action.
Which is the parent class of linkedlist class?
Can we remove element from arraylist while iterating?
What is precision?
Are the expressions arr and &arr same for an array of integers?
How do I start preparing for placement?
If you have to store one lakh objects, what will be a better option- a hash map or an array list?
What is the purpose of tochararray ()?
How to find the missing element in integer array of 1 to 7?
What is a Queue? Explain its operation with example?
