↓Skip to main content

Tree-Dp

LeetCode 2973: Find Number of Coins to Place in Tree Nodes

2026-09-12·3 mins

LeetCode Hard Dynamic-Programming Tree-Dp Depth-First-Search Sorting Heap Tree

LeetCode 2973 note: the max product of three is either the three largest or the two smallest times the largest, so each subtree returns only its 2 smallest and 3 largest values, merged in post-order

LeetCode 1373: Maximum Sum BST in Binary Tree

2026-09-10·2 mins

LeetCode Hard Dynamic-Programming Tree-Dp Binary-Search-Tree Depth-First-Search Tree

LeetCode 1373 note: a post-order traversal returns (sum, min, max, is_bst); a node roots a BST when the left max < its value < the right min