一、实验目的
1、进一步掌握指针变量、动态变量的含义。
2、掌握二叉树的结构特性，以及各种存储结构的特点和适用范围。
3、掌握用指针类型描述、访问和处理二叉树的运算。
二、实验内容
1、以二叉链表作存储结构，试编写前序、中序、后序遍历二叉树的算法。(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.)