Solo practice workspace

Interview Coder drill

Maximum Depth of Binary Tree

10:00

Easy

Given level-order tree values where null means no node, print the maximum root-to-leaf depth.

Example 1

Input: root = [3,9,20,null,null,15,7]

Output: 3

The deepest leaves are 15 and 7.

Constraints

0 <= node count <= 10^4Input uses space-separated level-order values

Recall before you code

Capture your plan, then rate how clearly you recalled it before submitting.

What cues point to the Trees DFS pattern?What invariant or template will you maintain?Which edge cases could break your approach?

How well did you recall the approach?

solution.py

Runs: 0 | Submissions: 0

Loading Python runtime...