What is the advantage of dequeue over circular queue?
Answers
Answered by
1
Hey mate ther is your answer
In c++
.. Circular Queue and Deque have different purpose. Circular queue is used when we want the iterator to comeback to start when we reach the last element of the queue. So there is not end iterator for cirular queue. There is no readily available data structure in C++ for circular queues.
Deque is a queue which stores address of first and last elements. So accessing elements or insertion at front or end will have O(1) complexity.
In c++
.. Circular Queue and Deque have different purpose. Circular queue is used when we want the iterator to comeback to start when we reach the last element of the queue. So there is not end iterator for cirular queue. There is no readily available data structure in C++ for circular queues.
Deque is a queue which stores address of first and last elements. So accessing elements or insertion at front or end will have O(1) complexity.
Similar questions