Given the root of a binary tree, return its maximum depth (number of nodes along the longest path from root to leaf).
Input: [3,9,20,null,null,15,7] Output: 3 Input: [1,null,2] Output: 2
Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features