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.
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.

Example 1:
Input: {"root":[3,9,20,null,null,15,7]}
Output: 2
Input
arr ={"root":[3,9,20,null,null,15,7]}

3

9

20

15

7

Variables
VariableValue
depth1
DepthFunction Call
Stack empty
0/8