题目描述
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建二叉树并返回。
代码如下
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* reConstructBinaryTree(vector<int> pre,vector<int> vin) {
if(pre.empty() || vin.empty()) return NULL;
vector<int> left_pre,right_pre,left_vin,right_vin;
TreeNode* root = new TreeNode(pre[0]);
int i = 0, j = 0;
while(j < vin.size()){
if(vin[j++] == pre[0]) break; }
while(i < j-1){
left_vin.push_back(vin[i++]);
left_pre.push_back(pre[i]);
}
while(j < pre.size())
{
right_pre.push_back(pre[j]);
right_vin.push_back(vin[j++]);
}
root->left = reConstructBinaryTree(left_pre,left_vin);
root->right = reConstructBinaryTree(right_pre,right_vin);
return root;
}
};