https://shio-chan-dev.github.io/jeanblog/zh/tags/%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86/Recent content in 后序遍历 on Jeanphilo BlogHugo -- 0.161.1zh-cnMon, 20 Apr 2026 09:37:25 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/124-binary-tree-maximum-path-sum/Mon, 20 Apr 2026 09:37:25 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/124-binary-tree-maximum-path-sum/围绕 LeetCode 124 讲清最大路径和的关键设计：递归向上只返回单边贡献，而经过当前节点的完整路径用来更新全局答案。https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/543-diameter-of-binary-tree/Sun, 19 Apr 2026 14:52:28 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/543-diameter-of-binary-tree/围绕 LeetCode 543 讲清二叉树直径的核心：递归返回高度、在当前节点更新全局直径，以及为什么最长路径不一定只看根到叶。https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/236-lowest-common-ancestor-of-a-binary-tree/Sun, 19 Apr 2026 14:52:28 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/236-lowest-common-ancestor-of-a-binary-tree/围绕 LeetCode 236 讲清最近公共祖先的后序返回值语义：子树返回什么、什么时候当前节点成为答案、以及为什么节点自己也可以是祖先。