ANOJ 1005 还原二叉树

// 层序中序  求先/后序
// ANOJ-180311-D
#include <cstdio>
const int MAXN = 10010;
int n, layer[MAXN], in[MAXN];
struct node {
	int data;
	node* l;
	node* r; 
};
node* create(int *layer, int *in, int t) { //t为(子)树中节点的个数
	if(t == 0) return NULL;
	int lLayer[MAXN], rLayer[MAXN], lIn[MAXN], rIn[MAXN];
	int cntLIn = 0, cntRIn = 0, cntLLayer = 0, cntRLayer = 0;
	node* root = new node;
	root->data = layer[0];
	int k;
	for(k=0; k<t; k++)
		if(in[k] == layer[0])
			break;
	//为lIn[]和rIn[]赋值
	for(int i=0; i<k; i++)
		lIn[cntLIn++] = in[i];
	for(int i=k+1; i<t; i++)
		rIn[cntRIn++] = in[i];
	//找出layer[]中分别与lIn[]和rIn[]相同的值，即为layer[]中的左子树和右子树，即为lLayer[]和rLayer[]赋值。
	for(int i=1; i<t; i++) {
		for(int j=0; j<cntLIn; j++)
			if(layer[i] == lIn[j])
				lLayer[cntLLayer++] = layer[i];
		for(int j=0; j<cntRIn; j++)
			if(layer[i] == rIn[j])
				rLayer[cntRLayer++] = layer[i];
	}
	root->l = create(lLayer, lIn, cntLLayer);
	root->r = create(rLayer, rIn, cntRLayer);
	return root;
}
void preOrderDFS(node* root) {
	if(root == NULL) return;
	printf("%d",root->data);
	preOrderDFS(root->l);
	preOrderDFS(root->r);
}
void postOrderDFS(node* root) {
	if(root == NULL) return;
	postOrderDFS(root->l);
	postOrderDFS(root->r);
	printf("%d ",root->data);
}
int main() {
	scanf("%d",&n);
	for(int i=0; i<n; i++) scanf("%d",&layer[i]);
	for(int i=0; i<n; i++) scanf("%d",&in[i]);
	node* root = create(layer, in, n); //实参为：数组的地址
	preOrderDFS(root); printf("\n");
	postOrderDFS(root);
	return 0;
}