Skip to main content

Maximum Depth of Binary Tree

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.

Problems26 / 152
Sign in

Maximum Depth of Binary Tree

EASYTreeDFS

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.

Example 1

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

Example 2

Input:  root = [1,null,2]
Output: 2
Show hint

Use recursion: return 1 + max of left and right subtree depths. Base case: return 0 for null node.

Draft saves automatically

Loading editor...

Submit also runs hidden tests
root =
[3,9,20,null,null,15,7]
Expected
3
Run with your own input (JSON)