该程序的功能为已知二叉树中序遍历和后序遍历序列，求二叉树的二叉链表结构，程序中假设前序序列和中序序列已经分别储存在数组Pre和In中，由子树的前序和中序序列建立其二叉链表，在中序序列中查找子树根，计算左右子树的大小，置队列为空队列，输出左右孩子并入队列中-The functions of the program in order for the known binary tree traversal and postorder traversal sequence, and the binary tree structure list, the program assumes the former order sequence and sequences in the sequence has been stored in the array, respectively, Pre and In by sub-tree in the sequence before the sequence and the sequence of the establishment of second fork list, in order to find sub-sequences Shugen calculated about the size of subtree, home Queue queue is empty, the output about the children into the queue