Queue (FIFO)

O(1) enqueue/dequeue

Pseudocode

enqueue(val): arr[rear++] = val dequeue(): return arr[front++]

Colour Guide

Front (Next to Dequeue)
Rear (Latest Added)
Removing Element

Queue Info

Size0
Front
Rear

Step Log

Complexity

EnqueueO(1)
DequeueO(1)
SpaceO(n)