【强化练习】利用后序位置解题 I

Prerequisites

Before reading this article, you need to learn:

• Basic Traversals of Binary Trees
• Dong's Guide to Binary Trees (Post-order Edition)
• Dong's Guide to Binary Trees (Summary Edition)

For some problems, if you approach them intuitively, you might find that you need to call other recursive functions within your recursive code to calculate subtree information. Generally, when this happens, you can consider optimizing your algorithm using post-order traversal thinking. By using post-order traversal, you can pass subtree information, avoiding high time complexity.

Balanced Binary Tree

Solution

Count Univalue Subtrees

Solution

Largest BST Subtree

Solution

Find Leaves of Binary Tree

Solution

Most Frequent Subtree Sum

Solution

Binary Tree Tilt

Solution

Binary Tree Longest Consecutive Sequence II

Solution

Delete Leaves With a Given Value

Solution

loading...