What is DQUEUE? Explain types of DQUEUE with an algorithm.
Answers
Answered by
1
Answer:
A deque, also known as a double-ended queue, is an ordered collection of items similar to the queue. It has two ends, a front and a rear, and the items remain positioned in the collection. ... In a sense, this hybrid linear structure provides all the capabilities of stacks and queues in a single data structure.
Explanation:
pls follow me and mark my answer as the brainliest
Answered by
1
Answer:
I hope it's help you.
Explanation:
A double ended queue also called as deque (pronounced as 'deck' or 'dequeue') is a list in which the elements can be inserted or deleted at either end in constant time. It is also known as a head-tail linked list because elements can be added to or removed from either the front (head) or the back (tail) end.
Similar questions