Practice Minimum Depth of Binary Tree
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Easy#111
LeetCode ProblemMinimum Depth of Binary Tree
Problem Statement
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. Note: A leaf is a node with no children.
Source: Minimum Depth of Binary Tree on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
root = [3,9,20,null,null,15,7]
Output
2
# Example 2
Input
root = [2,null,3,null,4,null,5,null,6]
Output
5
Constraints
The number of nodes in the tree is in the range [0, 10^5].
-1000 <= Node.val <= 1000
Related LeetCode Problems
Practice more problems similar to Minimum Depth of Binary Tree.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.