A circularly linked list is used to represent a Queue. A single variable p is used to access the Queue. To which node should p point such that both the operations enQueue and deQueue can be performed in constant time?
(A) rear node
(B) front node
(C) not possible with a single pointer
(D) node next to front
Explanation: See http://quiz.geeksforgeeks.org/data-structures-linked-list-question-12/
Quiz of this Question