Consider, a singly circular linked list is used to represent a Queue. There is only one p

Question:

Consider, a singly circular linked list is used to represent a Queue. There is only one p variable to access the queue. To which node should p point such that both the operations enQueue and deQueue can be performed in constant time? (GATE 2004)

image text in transcribed

A. rear node 

B. front node 

C. not possible with a single pointer 

D. node next to front

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: