# Heavy Light Path Decomposition: Walkthrough

Heavy Light Path Decomposition shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Classify each tree edge as heavy (to the largest child) or light and put every heavy path on its own segment tree so a u-v path is O(log n) contiguous segments.

## 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(log^2 n) path queries and updates with a segment tree on each heavy path.

## Common mistake

Jumping from u to v without first lifting both to the same heavy path head, which mixes unrelated segments into the query.

## 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 try it free.