Return the maximum depth of a binary tree — the number of nodes on the longest root-to-leaf path.
Input: one line — the tree in level order, null for missing children.
Output: the depth (0 for an empty tree).
3 9 20 null null 15 7
3
1 null 2
2
Run your code against the sample tests, or Submit to run the full suite.