##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Diameters, paths, and matchings
Tree DP solves problems where you compute properties of nodes based on their subtrees. Classic examples include tree diameter, maximum path sum, and counting valid colorings.
This works because trees have no cycles. Once you remove a node, subtrees become independent. This is very useful, and you will see why.
