Introduction - If you have any usage issues, please Google them yourself
First, the purpose of the experiment
1. Further grasp the meaning of the pointer variable and the dynamic variable.
2. Mastering the structure characteristics of the two forked tree, and the characteristics and application scope of various storage structures.
3, mastering the operation of describing, accessing and processing the two fork tree with pointer type.
Two. The content of the experiment
1. Using the two chain list as the storage structure, we try to write the algorithm of traversing the two forked tree in the preorder, the middle order and the post order.