# Maximum Product Of Splitted Binary Tree: Walkthrough

Maximum Product Of Splitted Binary Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

First pass total sum, second pass max(sub * (total-sub)) for every subtree sum.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS/DFS, union-find, topological sort, or tree DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Overflow: take modulo only on the final product, not on the running subtree sums used for comparison.

## 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 the Linkjob AI app.