Data Structures19 sections · 729 units
Open in Course

Queue Visualization

See it work

Trace operations on an empty queue: Enqueue 33: queue is [3][3]

Enqueue 77: queue is [3,7][3, 7]

Enqueue 11: queue is [3,7,1][3, 7, 1]

Dequeue: returns 33, queue is [7,1][7, 1]

Front: returns 77, queue stays [7,1][7, 1]

Dequeue: returns 77, queue is [1][1]

Elements leave in the order 3,7,13, 7, 1, the same order they arrived. That's FIFO.