二叉树，已知前序、中序，求后序...

有一个二叉树，给出它的后序遍历、中序遍历，求前序遍历

思路：== 根据后序、中序建树，然后前序遍历输出。==

#include <iostream>
using namespace std;

class TreeNode 
{
public:
	TreeNode* lchild;
	TreeNode* rchild;
	int data;
	TreeNode(int data) {
		this->data = data;
		this->rchild = this->lchild = nullptr;
	}
};
void preOrder(TreeNode* p) {
	if (p != nullptr)
	{
		cout << p->data << " ";
		preOrder(p->lchild);
		preOrder(p->rchild);
	}
}
TreeNode* creat(int* a, int* b, int t1, int t2, int num) {
	TreeNode* p = nullptr;
	for (int i = 0; i < num; i++)
	{
		if (a[t1] == b[t2 - i]) 
		{
			p = new TreeNode(a[t1]);
			p->lchild = creat(a, b, t1 - i - 1, t2 - i - 1, num - i - 1);
			p->rchild = creat(a, b, t1 - 1, t2, i);
			break;
		}
	}
	return p;
}

int main()
{
	int n;
	while (cin >> n)
	{
		int* a = new int[n];
		int* b = new int[n];
		for (int i = 0; i < n; i++)
		{
			cin >> a[i];
		}
		for (int i = 0; i < n; i++)
		{
			cin >> b[i];
		}
		TreeNode* root;
		bool flag = true;
		root = creat(a, b, n - 1, n - 1, n);
		preOrder(root);
		cout << endl;
		delete[] a, b;
	}
	return 0;
}

有一个二叉树，给出它的前序遍历、中序遍历，求后序遍历

#include <iostream>
using namespace std;

class TreeNode 
{
public:
	TreeNode* lchild;
	TreeNode* rchild;
	int data;
	TreeNode(int data) {
		this->data = data;
		this->rchild = this->lchild = nullptr;
	}
};

TreeNode* creat(int* a, int* b, int t1, int t2, int num) {
	TreeNode* p = nullptr;
	for (int i = 0; i < num; i++)
	{
		if (a[t1] == b[t2 + i])
		{
			p = new TreeNode(a[t1]);
			p->lchild = creat(a, b, t1 + 1, t2, i);
			p->rchild = creat(a, b, t1 + i + 1, t2 + i + 1, num - i - 1);
			break;
		}
	}
	return p;
}

void postOrder(TreeNode* p, bool flag) {
	if (p != nullptr)
	{
		postOrder(p->lchild, false);
		postOrder(p->rchild, false);
		if (flag)
		{
			cout << p->data;
		}
		else
		{
			cout << p->data << " ";
		}
	}
}

int main() {
	int n;
	while (cin >> n)
	{
		int* a = new int[n];
		int* b = new int[n];
		for (int i = 0; i < n; i++)
		{
			cin >> a[i];
		}
		for (int i = 0; i < n; i++)
		{
			cin >> b[i];
		}
		TreeNode* root;
		bool flag = true;
		root = creat(a, b, 0, 0, n);
		postOrder(root, flag);
		cout << endl;
		delete[] a, b;
	}
	return 0;
}