Concept: FIFO (First In, First Out).

Example:

from collections import deque

q = deque()
q.append(1)
q.append(2)
print(q.popleft())  # 1

Use cases: BFS, task scheduling.