##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Tracing the two-state DP
Rob houses on a tree where adjacent nodes can't both be robbed. Each node returns : max money if robbed vs skipped. Example tree: root=, left=, right=, left.right=, right.right=. Post-order builds answers bottom-up. At leaves: . At node 2 with child 3: rob=, skip=. So . At root : left=(,), right=(,). Rob=. Skip=.
Answer: .
