证明由一棵二叉树的先序序列和中序序列可唯一确定这棵二叉树（It is proved that the two binary tree can be uniquely determined by the first order sequence and the middle sequence of a two tree）.docVIP

证明由一棵二叉树的先序序列和中序序列可唯一确定这棵二叉树（It is proved that the two binary tree can be uniquely determined by the first order sequence and the middle sequence of a two tree） Proof: by the first order sequence of two binary tree and sequence uniquely determines the two binary tree.Txt first laugh because I met you, the first time to cry because you are not in, the first smile in tears because you can not have. Because you know the first traversal, the first one is uniquely determined. Then in order traversal in the root of it will be divided into two parts, the first of the two sub tree root root will be determined only in such push, all the root of the subtree are uniquely determined, two tree is unique. Problem solving procedure 1. determine the root node (the first letter) by the ordinal sequence 2. divide the sequence into two segments at the root node, the left one in the front, and the right subtree at the back The latter step is basically the repetition of the previous two steps Notice the concepts of the preorder sequence and the ordered sequence, which is easy to solve #includestdio.h #includestdlib.h Typedef char TElemType; //Status is the type of function whose value is the result of the function status code Typedef int status; The result of the function / status code #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define INFEASIBLE -1 #define OVERFLOW -2 Int w=0; #define Link 0 #define Thread 1 Typedef struct BiThrNode { TElemType data; Struct BiThrNode *lchild, *rchild; / / pointer about children Int, LTag, RTag; }BiThrNode, *BiThrTree; Two / structure of two binary tree binary tree representation Status createbitree (BiThrTree T) { Char ch; Scanf (%c, ch); If (ch==$) T=NULL; Else { If (... (T= (BiThrNode *), malloc (sizeof (BiThrNode))) exit (OVERFLOW); T-data =ch; T-LTag=Link; T-RTag=Link; Createbitree (T-lchild); Createbitree (T-rchild); } Return OK; } Void InThreading (BiThrTree p, BiThrTree pre) {/ / algorithm 6.7 //BiThrTree pre; If (P) { InThreadi