Binary Tree Level Order Traversal
You are given the root of a binary tree. Return the values level by level: first the root, then the root's children, then the next level, and so on. Inside a level go from left to right. Return a list of lists, one per level. An empty tree gives [].
Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.
Example 1
root [3,9,20,null,null,15,7]
returns [[3],[9,20],[15,7]]
Levels: [3], [9, 20], [15, 7].
Constraints
0 <= number of nodes <= 100-100 <= node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.