【强化练习】同时运用两种思维解题

Prerequisites

Before reading this article, you should first learn:

• Basic Traversals of Binary Trees
• Dongge's Guide to Binary Trees (Overview)

Some problems can be solved using both "traversal" and "problem decomposition" approaches. You can use these problems to train your thinking.

Nested List Weight Sum

Solution

Nested List Weight Sum II

Solution

Path Sum

Solution

Path Sum II

Solution

Merge Two Binary Trees

Solution

Increasing Order Search Tree

Solution

Range Sum of BST

Solution

Find a Corresponding Node of a Binary Tree in a Clone of That Tree

Solution

Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree

Solution

树的子结构 LCOF

Solution

loading...