Interactive Queue Visualization

About Queues

A queue is a First-In-First-Out (FIFO) data structure. Think of it like a line of people waiting:

• Enqueue – Add an item to the rear of the queue
• Dequeue – Remove an item from the front of the queue
• Peek Front – View the front item without removing it
• Peek Rear – View the rear item without removing it

Common uses include task scheduling, print spooling, and breadth-first search algorithms.