Traverse trees level-by-level using a queue. Essential for shortest-path, level-order, and zigzag problems.