【PTA】【L2-006】树的遍历 (25 分)

 思路：正常建树并层序遍历即可。（前面有发过建树模板）

#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
const int N = 35;
int n, post[N], mid[N];

typedef struct tree {
	int data;
	tree* lchild, * rchild;
}TNode, *Tree;

// 参数依次此为中序起点 后序起点 子树长度
Tree CreateByPost(int x, int y, int z)
{
	if (z == 0) 
		return NULL;
	Tree T = new TNode;
	T->data = post[y + z - 1];

	int len;
	for (int i = x; i < x + z; i++)
	{
		if (mid[i] == post[y + z - 1]) {
			len = i - x;
			break;
		}
	}
	T->lchild = CreateByPost(x, y, len);
	T->rchild = CreateByPost(x + len + 1, y + len, z - len - 1);
	return T;
}

// 层序遍历 flag 为了控制行末尾没有多余空格
bool flag = 0;
void bfs(Tree T)
{
	queue<Tree>q;
	q.push(T);
	while (!q.empty())
	{
		Tree t = q.front();
		q.pop();
		if (t->lchild != NULL)
			q.push(t->lchild);
		if (t->rchild != NULL)
			q.push(t->rchild);
		if (!flag){ 
			cout << t->data; 
			flag = 1;
		}
		else {
			cout << ' ' << t->data;
		}
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> post[i];
	}

	for (int i = 1; i <= n; i++) {
		cin >> mid[i];
	}
	Tree T = CreateByPost(1, 1, n);
	bfs(T);
	return 0;
}