https://h30306.github.io/blog/tags/tree-dp/Recent content in Tree-Dp onHugo -- gohugo.ioenhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungSat, 12 Sep 2026 00:00:00 +0000https://h30306.github.io/blog/leetcode/leetcode-2973/Sat, 12 Sep 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-2973/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-orderhttps://h30306.github.io/blog/leetcode/leetcode-1373/Thu, 10 Sep 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1373/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