# Small-To-Large Merging On Subtrees: Explained
Small-To-Large Merging On Subtrees shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Always merge the smaller child's multiset into the larger one so each element moves O(log n) times across the whole 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
O(n log^2 n) with ordered sets, O(n log n) with hash maps.
## Common mistake
Copying the larger child into the smaller one, which blows up to 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 www.linkjob.ai.