Queue

EnqueuedDequeuing

queue

FIFO — first in, first out

front →

queue is empty

→ back

pseudocode

enqueue(x)
  a[back] = x; back++
dequeue()
  x = a[front]; front++
  return x

Frame 1 / 12

Start

empty queue

Speed4

Operations

Comma-separated: "enqueue N" or "dequeue". 1–12 operations, values 1–99.