Problem 75 of 159Easy
LeetCode~15 min
LeetCode~15 minMinimum Depth of Binary Tree
Trees (BFS)
Asked at 6 companies
4 recent
- Bloomberg
- tcs
- Amazon
- Microsoft
- Meta
Community-reported · source · updated 2026-10-08. ● asked in the last 6 months.
Go step by step: try it yourself before the video and the visual. Progress saves on this device.
Step 1
Know these before you start
Tick what you already know
Concept videoStep 2
Try it on paper
5–10 minutes, no code yet
About this problem
BFS to find shortest path to leaf
Read the full statement and examples on LeetCode, try it for 15 min, then come back for the walkthrough and the step-by-step visual.
Step 6
Get it accepted
All test cases pass
Step 7
Review it so it sticks
Re-solve from memory after
Your notes
Three lines in your own words. They come back with this problem's reviews, so you can check yourself after recalling the solution.
Solve it yourself before you look
Reading the solution first feels like progress, but it makes the next similar problem — and the interview version — much harder, because you skipped the part where you figure it out. Give it an honest 20–30 minutes. Stuck? Re-read the pattern, watch the concept video, or try the brute force first.
Hidden: optimal solution