Problem 102 · Medium

Binary Tree Level Order Traversal

BFS with a queue; drain each level completely before enqueuing the next layer.

Open the interactive visualisation