已知先序遍历和中序遍历

首先前序遍历的第一个节点就是根节点，然后根据根节点把中序遍历分成两部分，左边部分是左子树的中序遍历，右边是右子树的中序遍历，然后根据左子树的中序遍历在谦虚遍历序列中找到左子树的前序遍历，右子树的前序遍历，然后重复上述过程，建立二叉树。

#include<iostream>
#include<vector>
#include<queue>
using namespace std;
struct Node
{
	char ch;
	Node* left;
	Node* right;
	Node()
	{
		ch = 0;
		left = nullptr;
		right = nullptr;
	}
};
Node* create(vector<char>&pre, vector<char>&mid)
{
	if (pre.size() == 0 || mid.size() == 0)return nullptr;
	char rootvalue = pre[0];
	Node* root = new Node;
	root->ch = rootvalue;
	int i = 0;
	while (mid[i] != rootvalue)i++;
	vector<char>lmid(mid.begin(), mid.begin() + i);//获取二叉树左边的中序遍历
	vector<char>rmid(mid.begin() + i + 1, mid.end());
	vector<char>lpre(pre.begin() + 1, pre.begin() + i + 1);
	vector<char>rpre(pre.begin() + i + 1, pre.end());
	root->left = create(lpre, lmid);
	root->right = create(rpre, rmid);
	return root;
}
void postorder(Node* root)
{
	if (root == nullptr)return;
	postorder(root->left);
	postorder(root->right);
	cout << root->ch << " ";
}
int main()
{
	vector<char>pre = { 'A', 'D', 'C', 'E', 'F', 'G', 'H', 'B' };
	vector<char>mid = { 'C', 'D', 'F', 'E', 'G', 'H', 'A', 'B' };
	queue<Node*>q;
	Node* root=create(pre, mid);
	postorder(root);
	cout << endl;
	q.push(root);
	while (!q.empty())//销毁二叉树，防止内存泄露
	{
		Node* head = q.front();
		q.pop();
		if (head->left)q.push(head->left);
		if (head->right)q.push(head->right);
		delete head;
	}
	return 0;
}