On Trees

← Back to Dynamic Programming

Dynamic programming applied to tree-structured data. Tree DP computes optimal solutions by processing subtrees bottom-up or using rerooting techniques to efficiently compute answers for all root choices.

Key Properties

• Tree DP
• Rerooting

---

algorithms dynamic-programming tree-dp