Grokking the Coding Interview: Patterns for Coding Questions

Ask Author

Back to course home

0% completed

Minimum Depth of a Binary Tree (easy)

Problem Statement

Find the minimum depth of a binary tree. The minimum depth is the number of nodes along the shortest path from the root node to the nearest leaf node.

Example 1:

Example 2:

Constraints:

The number of nodes in the tree is in the range [0, 10<sup>5</sup>].
-1000 <= Node.val <= 1000

Try it yourself

Try solving this question here:

.....

.....

.....

Like the course? Get enrolled and start learning!