# Sack On Trees Subtree Queries: Practice Notes
Sack On Trees Subtree Queries shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
DSU-on-tree: recurse into the heavy child first and keep its data, then add light subtrees, answer the node, and wipe light data on the way out.
## 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) if each node is added O(log n) times.
## Common mistake
Clearing the heavy child's data after answering, which forces a full rebuild higher up.
## 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 help for online coding assessments.