输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{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) {
size_t size = pre.size();
if(size <= 0)
return nullptr;
int root_val = pre[0];
int i ;
int r = 0;
for(i = 0; i < size; ++i)
{
if(vin[i] == root_val)
{
r = i;
break;
}
}
vector<int> left_pre;
vector<int> left_vin;
vector<int> right_pre;
vector<int> right_vin;
for(i = 1; i <= r;i++)
left_pre.push_back(pre[i]);
for(i = 0;i<r;++i)
left_vin.push_back(vin[i]);
for(i = r + 1; i < size; ++i)
right_pre.push_back(pre[i]);
for(i = r + 1; i < size; ++i)
right_vin.push_back(vin[i]);
TreeNode* root = new TreeNode(root_val);
root->left = reConstructBinaryTree(left_pre,left_vin);
root->right =reConstructBinaryTree(right_pre,right_vin);
return root;
}
};