##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Classic tree DP problem
Find the maximum sum path in a binary tree. A path can start and end at any nodes, but must follow edges. observation: at each node, the path either passes through it (joining left and right subtrees) or is entirely in one subtree.
Return two values: = max sum path starting at this node and going down, = max path in subtree. At node : . .
