144. Maximum Depth of Binary Tree

Easy

Topics

Companies

Hint

Understand Before Coding

Step 1 / 31

Speed: 1.0x

BFS Traversal

Commentary

Initialize max to 0 and a queue with the root node at depth 1.

Queue Status

0

3d:1

Variables

max0

queue[[root, 1]]

Loading visualization...

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

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

Output: 3

Explanation: The longest path is 3 -> 20 -> 15 or 3 -> 20 -> 7.

Example 2:

Input: root = [1,null,2]

Output: 2

Explanation: The longest path is 1 -> 2.

Example 3:

Input: root = []

Output: 0

Explanation: An empty tree has a depth of 0.

Constraints:

•
•

Time Complexity

N/A

Space Complexity

N/A

144. Maximum Depth of Binary Tree

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

144. Maximum Depth of Binary Tree

Understand Before Coding

BFS Traversal

Commentary

Queue Status

Variables

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

BFS Traversal

Commentary

Queue Status

Variables