rebuild_main.cpp

给一棵结点编号为1, 2, …, n 的二叉树的前序遍历序列和中序遍历序列

#include "rebuild.h"

void main()
{
	int n,i,flag;
	flag=1;
	scanf("%d",&n);
	int* pre = (int*) malloc((n+1) * sizeof(int));
	if (!pre)	exit(OUT_OF_MEM);
	int* in = (int*) malloc((n+1) * sizeof(int));
	if (!in)	exit(OUT_OF_MEM);
	for(i=0;i<n;i++)
		scanf("%d",&pre[i]);
	for(i=0;i<n;i++)
		scanf("%d",&in[i]);
	
	Bintree* btr=CreateTree(pre,in,n,&flag);
	if(flag==0)
		printf("-1");
	else
		PostorderTraversal(btr);
	printf("\n");
}