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

Prerequisites

Before reading this article, you should first learn:

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

Basic binary tree functions like summing values or calculating height are easy to write. Sometimes, simply adding a bit of code at their post-order position can give us the desired result.

Equal Tree Partition

Solution

Longest Univalue Path

Solution

Smallest Subtree with all the Deepest Nodes

Solution

Maximum Difference Between Node and Ancestor

Solution

Maximum Average Subtree

Solution

Maximum Product of Splitted Binary Tree

Solution

Longest ZigZag Path in a Binary Tree

Solution

Tree Diameter

Solution

loading...