663. 均匀树划分 https://leetcode.cn/problems/equal-tree-partition
663. Equal Tree Partition https://leetcode.com/problems/equal-tree-partition
687. 最长同值路径 https://leetcode.cn/problems/longest-univalue-path
687. Longest Univalue Path https://leetcode.com/problems/longest-univalue-path
865. 具有所有最深节点的最小子树 https://leetcode.cn/problems/smallest-subtree-with-all-the-deepest-nodes
865. Smallest Subtree with all the Deepest Nodes https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes
1026. 节点与其祖先之间的最大差值 https://leetcode.cn/problems/maximum-difference-between-node-and-ancestor
1026. Maximum Difference Between Node and Ancestor https://leetcode.com/problems/maximum-difference-between-node-and-ancestor
1120. 子树的最大平均值 https://leetcode.cn/problems/maximum-average-subtree
1120. Maximum Average Subtree https://leetcode.com/problems/maximum-average-subtree
1339. 分裂二叉树的最大乘积 https://leetcode.cn/problems/maximum-product-of-splitted-binary-tree
1339. Maximum Product of Splitted Binary Tree https://leetcode.com/problems/maximum-product-of-splitted-binary-tree
1372. 二叉树中的最长交错路径 https://leetcode.cn/problems/longest-zigzag-path-in-a-binary-tree
1372. Longest ZigZag Path in a Binary Tree https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree
1245. 树的直径 https://leetcode.cn/problems/tree-diameter
1245. Tree Diameter https://leetcode.com/problems/tree-diameter
606. 根据二叉树创建字符串 https://leetcode.cn/problems/construct-string-from-binary-tree
606. Construct String from Binary Tree https://leetcode.com/problems/construct-string-from-binary-tree
1443. 收集树上所有苹果的最少时间 https://leetcode.cn/problems/minimum-time-to-collect-all-apples-in-a-tree
1443. Minimum Time to Collect All Apples in a Tree https://leetcode.com/problems/minimum-time-to-collect-all-apples-in-a-tree
Prerequisite Knowledge
Before reading this article, you need to learn:
Basic binary tree functions like summing up values or finding the height are easy to write. Sometimes, you just need to add a bit of code in their post-order positions to get the desired results.
