【2011】中序后序求层序

输入树的后序和中序排列，输出树的层次遍历

Sample Input:

7

2 3 1 5 7 6 4

1 2 3 4 5 6 7

Sample Output:

4 1 6 3 5 7 2

#include<iostream>
#include<queue>
using namespace std;
const int maxn = 110;
int post[maxn], in[maxn];
struct node {
	int data;
	struct node *left;
	struct node* right;
};
node *build_tree(int inL, int inR, int postL, int postR) {
	if (postL > postR)
		return NULL;
	node* root = new node;
	root->data = post[postR];
	int i;
	for (i = inL; i <= inR; i++) {
		if (in[i] == post[postR]) {
			break;
		}
	}
	int numk = i - inL;
	root->left = build_tree(inL, i-1, postL, postL +numk-1);
	root->right = build_tree(i + 1, inR, postL +numk, postR - 1);
	return root;
}
void layerorder(node* root) {
	queue<node*> q;
	q.push(root);
	while (!q.empty()) {
		node *now = q.front();
		cout << now->data;
		q.pop();
		if (now->left != NULL)
			q.push(now->left);
		if (now->right != NULL)
			q.push(now->right);
	}
}
int main() {
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> post[i];
	for (int i = 0; i < n; i++)
		cin >> in[i];
	node* root=build_tree(0, n - 1, 0, n - 1);
	layerorder(root);
	system("pause");
	return 0;
}