Study
C++ · DSA: stack and queue
LIFO stacks and FIFO queues with std::stack and std::queue, plus two classic uses: bracket matching and BFS.
- A stack is last-in-first-out; a queue is first-in-first-out.
- Breadth-first search is just a queue of nodes to visit next.