唯一的确定一棵二叉树由前序和中序序列

#include<stdio.h> #include<stdlib.h> #include<malloc.h> #include<string.h> #define MaxSize 20 typedef char DataType; #include"Bitree.h" int main() { for(;;) { int i; BiTreeNode *q[MaxSize+1]; BiTreeNode *root; int left,right,temp; // for(i=0;i<=MaxSize;i++) // // struct Node *q[MaxSize]; int Num[MaxSize]={0}; char strA[MaxSize],strB[MaxSize]; char point;int n; printf("******************************************************************************\n"); printf("Please input PreOrder:"); scanf("%s",strA); printf("****************************************\n"); printf("Please input InOrder:"); scanf("%s",strB); printf("****************************************\n\n"); n=strlen(strA); Initiate(&root); // printf("%d",n); for(i=0;i<n;i++) { point=strA[i]; temp=Search(strB,point); left=SearchLeft(Num,temp); right=SearchRight(Num,temp); if(left==-1&&right==-1) { q[temp]=InsertLeftNode(root,point); Num[temp]=1; } else if(left!=-1&&q[left]->rightChild==NULL) { q[temp]=InsertRightNode(q[left],point); Num[temp]=1; } else if(right!=-1&&q[right]->leftChild==NULL) { q[temp]=InsertLeftNode(q[right],point); Num[temp]=1; } } PrintBiTree(root,0); printf("****************************************\n\n"); printf("PreOrder: \t"); PreOrder(root->leftChild,Visit); printf("\nInOrder:\t"); InOrder(root->leftChild,Visit); printf("\nPostOrder: \t"); PostOrder(root->leftChild,Visit); printf("\n*****************************************************************************\n\t\t\t\bCopyright @ 2009 Gary All Right Reserved\n"); } return 0; }