/*
题目描述
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的
前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列
{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建二叉树并返回。
*/
class Solution {
public:
//根据前序遍历和中序遍历重建二叉树
TreeNode* reConstructBinaryTree(vector<int> pre, vector<int> vin)
{
if (pre.size() == 0 || vin.size() == 0)
return NULL;
size_t i = 0;
for (; i < vin.size(); i++)
{
if (vin[i] == pre[0])
break;
}
TreeNode*root = new TreeNode(pre[0]);
//保存左右子树
vector<int> pre_left, vin_left;
vector<int> pre_right, vin_right;
for (size_t j = 0; j < i; j++)
{
pre_left.push_back(pre[j+1]);
vin_left.push_back(vin[j]);
}
for (size_t j = i+1; j < vin.size(); j++)
{
pre_right.push_back(pre[j]);
vin_right.push_back(vin[j]);
}
root->left = reConstructBinaryTree(pre_left, vin_left);
root->right = reConstructBinaryTree(pre_right, vin_right);
return root;
}
};