Data Structures | Queue | Question 4

Last Updated :
Discuss
Comments

Which of the following operations on a queue data structure has a time complexity of O(1)? 

A) Enqueue 
B) Dequeue 
C) Peek 
D) Clear

A and B

B only

C only

A and D 

This question is part of this quiz :

Top MCQs on Queue Data Structure with Answers,JavaScript Queue
Tags:
DSA Quiz
JavaScript
Web Technologies
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