# Tree Diameter: Practice Notes

Tree Diameter shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

On an undirected tree the diameter is the longest simple path. Two BFS/DFS: first from any node to a farthest node u, then from u to a farthest node v; dist(u,v) is the diameter. Equivalently root the tree and combine the two longest child depths at each node.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Reporting the height of an arbitrary root, which can be much shorter than the true diameter.

## 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 AI assistant for technical interviews.