Interval DP works on linear structures: strings, arrays, sequences. But what about hierarchical structures? Trees have natural recursive structure. Each node's answer depends on its children's answers. Tree DP is the next step: instead of intervals, your subproblems are subtrees.
Instead of split points, you have child nodes. The core idea stays the same: break into subproblems, combine answers. The structure just changes from intervals to trees.