# Make Costs Of Paths Equal In A Binary Tree: Explained

Make Costs Of Paths Equal In A Binary Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A complete binary tree with costs; you may only increase a node's cost. Equalize every root-to-leaf path to the current maximum path, working from the leaves up: the extra you must add on an edge is the difference between the two child-path totals, and you accumulate those increments.

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

## Common mistake

Decreasing costs (not allowed) or equalizing node values instead of path sums.

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