二叉树的建立与遍历

可实现：

（1）树的创建采用先序方式，用特殊符号0表示左、右子树为空

（2）每次输入一个节点的值，可以根据自己的需要设计不同的节点结构

（3）节点的值为非零数

（4）可以（）形式输出创建的树

（5）用先序后序和中序遍历树

（6）销毁树

-Establishment and tree traversal can be achieved: (1) tree created using the first order approach, with special symbols 0 express the left and right subtree is empty (2) for each input the value of a node, you can according to their own needs Design of different node structure (3) non-zero value of the node number (4) can () to create the form of the output tree (5) after the first sequence and the sequence of traversal tree (6) the destruction of trees