Minimum Depth of a Binary Tree (easy)

Grokking Meta Coding Interview

Ask Author

Back to course home

0% completed

Minimum Depth of a Binary Tree (easy)

Table of Contents

Problem Statement

Examples

Try it yourself

Problem Statement

Given a root of the binary tree, 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.

Examples

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:

Python3

Python3

. . . .

Mark as Completed

Table of Contents

Problem Statement

Examples

Try it yourself