FIFO
Domain: Data Structures
🎯 Motivation
First-In-First-Out describes the access order of a queue: the earliest added item is the first to be removed.
📋 Concrete Example
Queue: enqueue A, enqueue B, enqueue C. Dequeue gives A (first in). Dequeue gives B. Dequeue gives C (last in, last out).
🔗 Analogy
A conveyor belt sushi restaurant. The first plate put on the belt is the first one a customer picks up at the other end.