Queue

FIFO (first in first out) data structure that is commonly used in bfs.

Three standard operations:

1. push: insert at the back
2. pop: delete from the front
3. front: access the first element without removing it

competitive_programming