# Minimum Depth Of Binary Tree: Practice Notes
Minimum Depth Of Binary Tree is a common tree question in coding rounds. Below is how I talk through it in an interview setting.
## Key idea
BFS returns at the first leaf it meets; DFS must ignore null children when only one child exists.
## Steps to say out loud
1. Restate the input and output, and ask about empty trees and duplicate values.
2. Name the traversal (DFS or BFS) and what each call returns.
3. Code it, then trace a three-node example by hand.
## Complexity
O(n).
## Common mistake
Taking min of both children when one is null gives depth 1 incorrectly.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edge cases. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI assistant for technical interviews.