# Maximum Product Of Splitted Binary Tree: Practice Notes
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: for each subtree s the split product is s * (total-s); return the max modulo 1e9+7.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (tree DFS, BST walk, or subtree 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
Splitting only at the root's two children and missing a better cut deeper in the tree.
## 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 multilingual AI interview assistant.