# Rerooting Tree DP: Explained

Rerooting Tree DP shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Compute a downward DP, then walk the tree and combine the parent's rerooted value with sibling contributions so every vertex becomes the root in linear extra time.

## 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) after the first downward pass (or O(n log n) if combining sibling values needs a sorted structure).

## Common mistake

Forgetting to exclude the child's own contribution when building the parent's message to that child, which double-counts the subtree.

## 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 here.