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
What is difference between list set and map?
How do you find the second largest element in an array of integers?
Differentiate between queue and deque.
What is a simple graph?
What are the applications of stack?
where do you use double linked list?
What is a map programming?
Can you store different types in an array?
How do you create a tree diagram?
Explain quick sort?
What is mergesort and hashtable?
What is a binary search tree? Explain with example?
State the rules to be followed during infix to prefix conversions?
What is entryset in hashmap?
What is the difference between Array and Array List ? Explain in brief with example.
