Back
Queue Visualizer
FIFO (First In, First Out) - Enqueue at rear, Dequeue from front
3
Size
10
Front
30
Rear
8
Max Size
Ready for queue operations
Value:
Speed:
Slow
Medium
Fast
Max Size:
6
8
10
Queue Structure (Front ← → Rear)
FRONT (Dequeue)
REAR (Enqueue)
10
Index 0
Front
→
20
Index 1
→
30
Index 2
Rear
Capacity: 3/8
Operation Flow
ENQUEUE
Add to rear
→
QUEUE
FIFO Structure
→
DEQUEUE
Remove from front
Enqueue
Dequeue
Peek
Clear
Queue Operations:
Basic Operations:
Enqueue:
Add element to rear of queue
Dequeue:
Remove and return front element
Peek/Front:
View front element without removing
isEmpty:
Check if queue is empty
Characteristics:
FIFO:
First In, First Out principle
Time Complexity:
O(1) for all operations
Space Complexity:
O(n) where n is number of elements
Use Cases:
Task scheduling, breadth-first search, print queues