postin.c

问题描述： 给定一棵有n 个结点的二叉树

# include <stdio.h>
# include <malloc.h>

int *a,*b;

void LocateRoot(int p1,int p2,int r1,int r2,int root){
	int i,j;	
	if(r1<=p1) return;
	for(i=p2;i<=r2;i++)
	    if(b[i]==root) break;
	j=p1+i-p2-1;
	if(j>=p1){
            printf(" %d",a[j]);
	    LocateRoot(p1,p2,j,i-1,a[j]);
        }
	if(j<r1-1){
            printf(" %d",a[r1-1]);
	    LocateRoot(j+1,i+1,r1-1,r2,a[r1-1]);
        }
}

int main(){
	int i,n;
	freopen("input.txt","r",stdin);
	freopen("output.txt","w",stdout);
	scanf("%d",&n);
	a=(int *)malloc(n*sizeof(int));
	b=(int *)malloc(n*sizeof(int));
	for(i=0;i<n;i++)
		scanf("%d",&a[i]);
	for(i=0;i<n;i++)
		scanf("%d",&b[i]);
        printf("%d",a[n-1]);
	LocateRoot(0,0,n-1,n-1,a[n-1]);
        printf("\n");
	free(b);
	free(a);
	return 0;
}