Queue (FIFO)

O(1) enqueue/dequeue

Front (Next to Dequeue)

Rear (Latest Added)

Removing Element

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

Size0

Front–

Rear–