# Diameter Of Binary Tree: Interview Notes
Diameter Of Binary Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
DFS returns height; at each node the longest path through it is leftHeight+rightHeight, and the diameter is the max of those.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (tree DFS, BST walk, or subtree DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Returning the height of the tree and calling it the diameter, which undercounts a wide shallow tree.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at this tool.