##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
LeetCode 337
Houses form a binary tree. Each house has money. You cannot rob two directly connected houses (parent and child). Find the maximum money you can rob. Example: Tree .
If you rob the root (), you cannot rob its children ( and ). The best is : take the root and two grandchildren. This is House Robber on a tree. For each node, you decide: rob it or skip it?
