# Dominator Tree Lengauer Tarjan: Interview Notes
Dominator Tree Lengauer Tarjan shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Compute immediate dominators of a flowgraph via DFS numbers, semidominators, and a forest with evaluated minima, then link them into a dominator tree.
## 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
Almost-linear O(m α(n)).
## Common mistake
Evaluating a semidominator on the original graph instead of the DFS spanning forest.
## 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 linkjob.ai.