# Sack DSU On Tree: Study Guide
Sack DSU On Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
DFS the tree, keep the largest child's color map, and insert the other subtrees into it (small-to-large) so subtree queries can be answered at the vertex before rolling back.
## 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) total because each vertex is inserted into O(log n) maps.
## Common mistake
Merging into the smaller child's map instead of the larger, which can become quadratic.
## 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 job interview answers in real time.