easyTrees
Maximum Depth of Binary Tree
## Problem
Given the root of a binary tree, return *its maximum depth*.
A binary tree's **maximum depth** is the number of nodes along the longest path from the root node down to the farthest leaf node.
> **Input format:** The tree is given as a level-order list where `None` represents a missing node. E.g., `[3,9,20,None,None,15,7]`.
Given the root of a binary tree, return *its maximum depth*.
A binary tree's **maximum depth** is the number of nodes along the longest path from the root node down to the farthest leaf node.
> **Input format:** The tree is given as a level-order list where `None` represents a missing node. E.g., `[3,9,20,None,None,15,7]`.
Examples
Input
root = [3,9,20,null,null,15,7]
Output
3
Depth 3: 3 → 20 → 15 (or 7).
Input
root = [1,null,2]
Output
2
Depth 2: 1 → 2.
Constraints
The number of nodes in the tree is in the range [0, 10^4].
-100 <= Node.val <= 100
Python
Loading...