Exercise: Binary Tree Post-order III labuladong Original About 6018 words
968. 监控二叉树 https://leetcode.cn/problems/binary-tree-cameras 968. Binary Tree Cameras https://leetcode.com/problems/binary-tree-cameras 979. 在二叉树中分配硬币 https://leetcode.cn/problems/distribute-coins-in-binary-tree 979. Distribute Coins in Binary Tree https://leetcode.com/problems/distribute-coins-in-binary-tree 1080. 根到叶路径上的不足节点 https://leetcode.cn/problems/insufficient-nodes-in-root-to-leaf-paths 1080. Insufficient Nodes in Root to Leaf Paths https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths 2049. 统计最高分的节点数目 https://leetcode.cn/problems/count-nodes-with-the-highest-score 2049. Count Nodes With the Highest Score https://leetcode.com/problems/count-nodes-with-the-highest-score Prerequisites
Before reading this article, you should first learn:
Code written in the post-order position is the most flexible. It can access the parent node (through function parameters) and gather information from the subtree (through recursive return values). A small number of more challenging problems will use both of these features.
Prev
Exercise: Binary Tree Post-order II
Next
Exercise: Binary Tree Level I