清华数据结构PA5——真二叉树重构(Proper Rebuild)

题目：https://dsa.cs.tsinghua.edu.cn/oj/problem.shtml?id=1146

题目给出了真二叉树的前序和后序遍历，只需对两者进行对比，就能得到根节点和左右子树，然后进行递归即可。

#include<iostream>
using namespace std;

struct node
{
	int data;
	node* lchild;
	node* rchild;
	node() :
		lchild(NULL), rchild(NULL) { }
	node(int e, node* lchild = NULL, node* rchild = NULL) :
		data(e), lchild(lchild), rchild(rchild) { }
};
void rebuild(node* root, int* pre, int* post, int n)
{
	if (n < 2)
	{
		return;
	}
	int postleft, preright;
	for (int i = 0; i < n; i++)
	{
		if (pre[i] == post[n - 2])
		{
			preright = i;
			break;
		}
	}
	for (int i = 0; i < n; i++)
	{
		if (post[i] == pre[1])
		{
			postleft = i;
			break;
		}
	}
	root->lchild = new node(pre[1]);
	root->rchild = new node(post[n - 2]);
	rebuild(root->lchild, pre + 1, post, preright - 1);
	rebuild(root->rchild, pre + preright, post + postleft + 1, n - postleft - 2);
}

void trav(node* root) {
	if (!root) return;
	trav(root->lchild);
	printf("%d ", root->data);
	trav(root->rchild);
}

int main()
{
	int n;
	scanf("%d", &n);
	int* pre = new int[n];
	int* post = new int[n];
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &pre[i]);
	}
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &post[i]);
	}
	node* root = new node(pre[0]);
	rebuild(root, pre, post, n);
	trav(root);
}