Queue

data-structures

Click Generate New or press Play

Step 1 / 1

Ready

Speed

First-In-First-Out (FIFO) data structure. Elements are added at rear and removed from front.

Time Complexity

Best

\mathrm{O}\left(1\right)

Avg

\mathrm{O}\left(1\right)

Worst

\mathrm{O}\left(1\right)

Space Complexity

Aux

\mathrm{O}\left(n\right)

n elements stored between front and rear pointers

Pseudocode

1Queue Operations:

2enqueue(value): add to rear

3dequeue(): remove from front

4peek(): view front element

5isEmpty(): check if empty