Concept: Cấu trúc LIFO (Last In, First Out).

Example:

stack = []
stack.append(10)
stack.append(20)
stack.append(30)
print(stack.pop())  # 30

Use cases: DFS, backtracking, undo feature.

Operations: push, pop, peek → O(1)