Data Structures | Queue | Question 4

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)

A and B

(B)

B only

(C)

C only

(D)

A and D

Answer: (B)
Explanation:

In a queue data structure, dequeueing (removing an element from the front of the queue) typically has a time complexity of O(1) because it involves removing the first element and adjusting the front pointer.

Hence, Option B is the correct option.

Quiz of this Question
Please comment below if you find anything wrong in the above post

Article Tags :

Data Structures

DSA

Data Structures

Data Structures-Queue

Recommended Articles

1. Should we declare as Queue or Priority Queue while using Priority Queue in Java?

2. Data Structures | Queue | Question 1

3. Data Structures | Queue | Question 2

4. Data Structures | Queue | Question 3

5. Data Structures | Queue | Question 5

6. Data Structures | Queue | Question 6

7. Data Structures | Queue | Question 11

8. Data Structures | Queue | Question 8

9. Data Structures | Queue | Question 11

10. Data Structures | Queue | Question 10

11. Data Structures | Queue | Question 11

12. Difference between Stack and Queue Data Structures

13. What is an in-memory Queue in Data Structures

14. What is Priority Queue | Introduction to Priority Queue

15. Stack and Queue in Python using queue Module

16. Check if a queue can be sorted into another queue using a stack

17. Reversing a Queue using another Queue

18. Difference between Circular Queue and Priority Queue

19. Advantages of circular queue over linear queue

20. Difference between Queue and Deque (Queue vs. Deque)

21. Why can't a Priority Queue wrap around like an ordinary Queue?

22. Can we use Simple Queue instead of Priority queue to implement Dijkstra's Algorithm?

23. Turn a Queue into a Priority Queue

24. Why does Queue have front but Priority-queue has top in stl?

25. What is Circular Queue | Circular Queue meaning