# DSU On Trees Sack: Practice Notes
DSU On Trees Sack shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Keep an unordered map of values only on the heavy child, then insert light subtrees into it and roll them back so each node is inserted O(log n) times.
## 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 log n) insertions.
## Common mistake
Forgetting to skip the heavy child during the light insertion pass, which duplicates its frequencies.
## 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 https://www.linkjob.ai/.