LIFO
Domain: Data Structures
🎯 Motivation
Last-In-First-Out describes the access order of a stack: the most recently added item is the first to be removed.
📋 Concrete Example
Stack: push 1, push 2, push 3. Pop gives 3 (last in). Pop again gives 2. Pop gives 1 (first in, last out).
🔗 Analogy
A narrow cupboard where you shove boxes in from the top. The last box you shoved in is the first one you can pull out.