Trees (BFS)

Traverse binary trees level by level using a queue. Master the queue-plus-level-size pattern to solve problems that require processing nodes one level at a time, including level-order traversal, per-level aggregation, and BFS-based serialization.