1020 Tree Traversals

小知识

new是c++中用来申请动态空间的运算符,其返回类型同样是申请的同变量类型的的指针
如, node* root = new node;新建一个node结构体,并且root指向其第一个

#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
const int maxn = 50;
struct node {
	int data;
	node* lchild;
	node* rchild;
};
int pre[maxn], in[maxn], post[maxn];
int n;
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 = inL; k <= inR; k++) {
		if (in[k] == post[postR])
			break;
	}
	int numleft = k - inL;
	root->lchild = create(postL, postL + numleft - 1, inL, k - 1);
	root->rchild = create(postL + numleft, postR - 1, k + 1, inR);
	return root;
}
int num = 0;//已输出的结点个数
void BFS(node* root) {
	queue<node*> q;//注意队列里是存地址
	q.push(root);
	while (!q.empty()) {
		node* now = q.front();
		q.pop();
		printf("%d", now->data);
		num++;
		if (num < n)	printf(" ");
		if (now->lchild != NULL)	q.push(now->lchild);
		if (now->rchild != NULL)	q.push(now->rchild);
	}
}
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);
	BFS(root);
}