Skip to content
Related Articles

Related Articles

GATE | GATE-CS-2004 | Question 36
  • Last Updated : 17 Sep, 2014

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?

circularLinkedList
(A) rear node
(B) front node
(C) not possible with a single pointer
(D) node next to front


Answer: (A)

Explanation: See http://quiz.geeksforgeeks.org/data-structures-linked-list-question-12/

Quiz of this Question

sudo-gate-course

My Personal Notes arrow_drop_up
Recommended Articles
Page :