A FIFO structure — enqueue adds to the rear, dequeue removes from the front, peek inspects it. All O(1).
A FIFO structure — enqueue adds to the rear, dequeue removes from the front, peek inspects it. All O(1).
Time complexity: O(1). Space complexity: O(n).
Use the interactive visualizer above to run Queue on your own input and watch every comparison, swap, and operation animate step by step — pause, scrub, or replay at any speed.