本程序用VC编写，实现建立一棵二叉树的功能，并对其进行遍历（先序、中序、后序），并且打印输出遍历结果。

1.输入的形式和输入值的范围：

输入二叉树的先序，当其结点为空时，需要输入#。（输入的先序仅含字母和#）

2.输出的形式：输出二叉树的先序、中序、后序。

3.程序所能达到的功能：实现建立一棵二叉树的功能，并对其进行遍历（先序、中序、后序），并且打印输出遍历结果。-This procedure compiles with VC, achieve the establishment of a binary function, and its traversal (first order, in sequence after sequence), and the printed output through the results. 1 input form and range of input values: Enter the first sequence of binary tree, the node when it is empty, you need to enter#. (Enter the first sequence containing only letters and#) 2 in the form of output: the output binary tree first sequence, sequence after sequence. 3 The program can achieve the function: function achieve the establishment of a binary tree, and its traversal (first order, in sequence after sequence), and the printed output through the results.