##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Example tree trace
Tree: root , left (left ), right (right ). DFS leaf (left of ): returns . DFS node : exclude , include . Returns . DFS leaf (right of ): returns . DFS node (right): exclude , include .
Returns . DFS root: exclude , include . Answer: . Taking the root and both grandchildren gives the maximum.
