二叉树 ：已知前序和中序，求后序

#include <stdio.h>
#include <stdlib.h>

#define SIZE 7

char data_qian[SIZE] ={'A','B','D','E','C','F','G'};
char data_zhong[SIZE] ={'D','B','E','A','F','C','G'};
//char data_hou[SIZE];

void TreeSequence(char *data_qian,char *data_zhong, int N){
	if(N == 0){
		return;
	}                               
	char data_hou = * data_qian;
	int rootpos = 0;
	for( ;rootpos<N;rootpos++){
		if(*data_qian == data_zhong[rootpos])
			break;
	}
	TreeSequence(data_qian+1,data_zhong,rootpos);
	TreeSequence(data_qian+rootpos+1,data_zhong+rootpos+1,N-(rootpos+1));
	printf("%c",data_hou);
}

void main(){
	TreeSequence(data_qian,data_zhong,SIZE);
	printf("\n");
}