# Tree Isomorphism AHU Canonical Names: Study Guide
Tree Isomorphism AHU Canonical Names shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Assign bottom-up sorted tuples of child names (AHU) so two rooted trees are isomorphic iff their roots share a name; try both centers for the unrooted case.
## 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) with radix/string hashing of the tuples.
## Common mistake
Comparing unsorted child-name lists, which treats isomorphic reorderings as different.
## 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 coding interview assistant.