# Smallest Subtree With All The Deepest Nodes: Explained
Smallest Subtree With All The Deepest Nodes is a common tree question in coding rounds. Below is how I talk through it in an interview setting.
## Key idea
DFS returns (depth, node); if left and right depths tie, the current node is the answer, else bubble up the deeper side.
## 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
Computing depth separately for every node makes it O(n^2).
## 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 www.linkjob.ai.