Tree DP Maximum Independent Set¶ Table of Contents¶ 337. House Robber III (Medium) 2646. Minimize the Total Price of the Trips (Hard) 2378. Choose Edges to Maximize Score in a Tree (Medium) 👑 337. House Robber III¶ LeetCode | 力扣 Tags: Dynamic Programming, Tree, Depth First Search, Binary Tree 2646. Minimize the Total Price of the Trips¶ LeetCode | 力扣 Tags: Array, Dynamic Programming, Tree, Depth First Search, Graph 2378. Choose Edges to Maximize Score in a Tree 👑¶ LeetCode | 力扣 Tags: Dynamic Programming, Tree, Depth First Search