Level-Order Traversal (BFS)

Visits a binary tree breadth-first, level by level, using a FIFO queue to process nodes in order.