Data Structures | Linked List | Question 12

Last Updated :
Discuss
Comments

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? (GATE 2004) 

rear node

front node

not possible with a single pointer

node next to front

This question is part of this quiz :

Top MCQs on Linked List Data Structure with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy