本程序包括二叉树的创建，各种遍历方法(前序，中序，后序以及各层算法）。-This process includes the creation of a binary tree, various traversal methods (pre-order, middle order, post order, and layers of algorithm).

用下面两种方法中的任一种建立y一棵n层的满二叉树。 (1) 按先序遍历递归调用建立链式满二叉树； (2) 按层序遍历二叉树方式建立链式满二叉树。 （3）把二叉树得凹入表示法打印出来 -Use either of the following two methods to establish a y a n-tier full binary tree. (1) according to preorder a recursive call to establish a chain fu