1、　　输入一个完全二叉树的层次遍历字符串，创建这个二叉树，输出这个二叉树的前序遍历字符串、中序遍历字符串、后序遍历字符串、结点数目、二叉树高度(上述每一个结果独立一行显示)。
2、　　输入二叉树前序序列和中序序列(各元素各不相同)，创建这个二叉树，输出该二叉树的后序序列、层次遍历。(, the input string level traversal of a completely two fork tree, creating the two binary tree, preorder traversal string, the output of the two binary tree traversal, postorder traversal string string, the number of nodes, two tree height (each row shows the results of independent).
2. Input the two forked tree preorder sequence and the middle sequence sequence (each element is different), create this two forked tree, output the rear sequence of the two tree and traverse the hierarchy.)