##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Example tree trace
Tree: ; ; . DFS visits: (leaf, size ), (leaf, size ), then (size ). Then (leaf, size ), then (size ). Finally (size ).
Subordinates: node has , node has , node has , nodes have . The post-order ensures children are done before parents. This ordering is what makes tree DP work.
