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?

Keep practicing — related questions

• Which of the following is/are the implementation(s) of the queue data structure?
• Which is the best Data structure?
• In which of the following linked lists is the null pointer in the last node replaced with the address of th...
• Which of the following types of linked list is the one where the null pointer in the last node is replaced ...
• Which of the following data structures is used to perform recursion?
• A priority queue can be implemented by using ____?
• Which of the following statements is true about queue data structure?
• Which of the following type of queues is the one in which all nodes are treated as circular such that the l...