• Tutorials
  • Courses
  • Tracks

Top | MCQs on Queue Data Structure with Answers | Question 30

Last Updated :
Discuss
Comments

Given a queue with a linked list implementation. the Rear pointer points to the rear node of the queue. and the front node of the queue points to the front node of the queue, Which of the following operations is impossible to do in O(1) time?
 

Delete the front item from the list.

Delete the rear from the list.

insert at the front of the list.

None

This question is part of this quiz :

Top MCQs on Queue Data Structure with Answers
Tags:
DSA Quiz
Share your thoughts in the comments