Section III. Two fork tree and partition method

Tips

1. Master the use of stacks to achieve the non-recursive method of the pre-sequence traversal and the middle sequence traversal.

2. Distinguish between recursion and division. Divide and conquer is an algorithm, recursion is a kind of implementation of the program. Recursion does not necessarily have the idea of splitting, for example, in the traversal of a binary tree, the Ergodic method is also implemented recursively, but it is not a divide-and-conquer method. 90% of the two fork tree topics are considered in the division and treatment method.

3 for the topic of sequence traversal to use BFS. Master the sequence traversal of a binary tree using a queue.

4 Learn about using DFS to do sequence traversal.

Section III. Two fork tree and partition method