Minimum Depth of Binary Tree

Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

30:00

Minimum Depth of Binary Tree

easy

Topics

Companies

Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

Example 1:

Input: {"root":[3,9,20,null,null,15,7]}

Output: 2

Constraints:

The number of nodes is in the range $[0, 10^5]$ .
$-1000 \leq \text{Node.val} \leq 1000$

Input

arr ={"root":[3,9,20,null,null,15,7]}

3

9

20

15

7

Variables

Variable	Value
depth	1

DepthFunction Call

Stack empty

0/8