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

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)

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.

Binary Tree Cameras

Solution

Distribute Coins in Binary Tree

Solution

Insufficient Nodes in Root to Leaf Paths

Solution

Count Nodes With the Highest Score

Solution

loading...