1020 Tree Traversals （25 分） 树的后序中序与层序

#include<cstdio>
#include<queue>
using namespace std;
const int maxn = 35;
int post[maxn], in[maxn];
int n;
struct node
{
	int data;
	node *left;
	node *right;
};
node* create(int postL, int postR, int inL, int inR)//以结点地址构造树
{
	if (postL > postR) return NULL;
	node* root = new node;
	root->data = post[postR];
	int k;
	for (k = 0; k < n; k++)
	{
		if (in[k] == post[postR])
			break;
	}
	int numleft = k - inL;
	root->left = create(postL, postL + numleft - 1, inL, k - 1);
	root->right = create(postL + numleft, postR - 1, k + 1, inR);
	return root;
}
void level(node* root)
{
	int count = 0;
	queue<node*> q;
	q.push(root);
	while (!q.empty())
	{
		count++;
		node* now = q.front();
		q.pop();
		printf("%d", now->data);
		if (count != n) printf(" ");
		if (now->left != NULL) q.push(now->left);
		if (now->right != NULL) q.push(now->right);
	}
}
int main()
{
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &post[i]);
	}
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &in[i]);
	}
	node* root = create(0, n - 1, 0, n - 1);
	level(root);
	return 0;
}