Exercise: Binary Tree Post-order I

labuladongOriginalAbout 2970 words

Prerequisite Knowledge

Before reading this article, you need to learn:

Basics of Binary Tree Traversal
Binary Tree Techniques (Postorder Chapter)
Binary Tree Techniques (General Chapter)

For some problems, if you try to solve them by intuition, you might find that you need to call other recursive functions within your recursive code to calculate certain information. Generally, when this happens, you can consider using a postorder traversal approach to optimize the algorithm. By using postorder traversal, you can pass information from the subtrees, which helps avoid excessively high time complexity.

Exercise: Binary Tree Post-order I

110. 平衡二叉树 https://leetcode.cn/problems/balanced-binary-tree

110. Balanced Binary Tree https://leetcode.com/problems/balanced-binary-tree

508. 出现次数最多的子树元素和 https://leetcode.cn/problems/most-frequent-subtree-sum

508. Most Frequent Subtree Sum https://leetcode.com/problems/most-frequent-subtree-sum

563. 二叉树的坡度 https://leetcode.cn/problems/binary-tree-tilt

563. Binary Tree Tilt https://leetcode.com/problems/binary-tree-tilt

1325. 删除给定值的叶子节点 https://leetcode.cn/problems/delete-leaves-with-a-given-value

1325. Delete Leaves With a Given Value https://leetcode.com/problems/delete-leaves-with-a-given-value