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) A. rear node B. front node C. not possible with a single pointer D. node next to front

   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)
A. rear node
B. front node
C. not possible with a single pointer
D. node next to front

Show more…

Data Structures Using C

Data Structures Using C

Amol M. Jagtap, Ajit… 1st Edition

Chapter 4, Problem 10

Instant Answer

Step 1

## Step-by-Step Solution Show more…

Show all steps

lock

Thanks for your feedback!

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) A. rear node B. front node C. not possible with a single pointer D. node next to front

Play audio

Feedback

Powered by NumerAI

Ace is your personal tutor. It breaks down any question with clear steps so you can learn.

Start Using Ace

Continue solving this problem

Create a free account to:

View full step-by-step solution
Ask follow-up questions with Ace AI
Save progress and study later