Number of Nodes on Each Level
You are given the root of a binary tree. Return a list where item d is the number of nodes on level d (the root is level 0). 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 [1,2,2]
Level sizes: 1, 2, 2.
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.