Problem
Given the root of a binary tree, return its maximum depth. The maximum depth is the number of nodes along the longest path from root to leaf.
Test Cases
Standard tree
Input: root=[3,9,20,null,null,15,7]
Expected: 3
Right-skewed
Input: root=[1,null,2]
Expected: 2
Empty tree
Input: root=null
Expected: 0