题目描述:
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{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) {
int in_len = vin.size();
if(in_len == 0)//空树
return NULL;
vector<int> pre_left,pre_right,in_left,in_right;
TreeNode* root = new TreeNode(pre[0]);//根节点是先序遍历数组中的第一个元素
int in_root = 0;
for(int i = 0;i < in_len;++i){//查找中序遍历数组中根节点所在位置的下标
if(vin[i] == root->val){
in_root = i;
break;
}
}
for(int i = 0;i < in_root;++i){
//根节点的左子树
in_left.push_back(vin[i]);
pre_left.push_back(pre[i+1]);
}
for(int i = in_root+1;i < in_len;++i){
//根节点的右子树
in_right.push_back(vin[i]);
pre_left.push_back(pre[i]);
}
root->left = reConstructBinaryTree(pre_left,in_left);
root->right = reConstructBinaryTree(pre_right,in_right);
return root;
}
};