A linked list Queue

A circularly linked list is used to represent a queue as shown in the figure above. A single variable \(Q\) is used to access the Queue. To which node should \(Q\) point such that both the operations enQueue and deQueue can be performed in \(O(1)\) time?

×

Problem Loading...

Note Loading...

Set Loading...