Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 111. Minimum Depth of Binary Tree
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.