Available question text
Find the minimum number of nodes from the root to the nearest leaf in a binary tree (a leaf has no children), noting that nodes with only one child are not leaves. In other words, compute the length of the shortest root-to-leaf path—commonly solved by BFS to discover the nearest leaf early.
Related questions
Continue with questions that share topics or the same question type.
- Maximum Depth of Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Minimum Flips in Binary Tree to Get Result
Coding
- Minimum Number of Operations to Sort a Binary Tree by Level
Coding
- Second Minimum Node In a Binary Tree
Coding · Binary Tree · Depth-First Search · Tree
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 111. Minimum Depth of Binary Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source