重建二叉树
题目描述
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{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_Core(vector<int> pre, vector<int> vin, int preBegin, int preEnd, int vinBegin, int vinEnd){
if(preBegin > preEnd)
return NULL;
TreeNode* root = new TreeNode(pre[preBegin]);
int left = 0;
int i;
for(i = vinBegin; i <= vinEnd; i++){
if(vin[i] == pre[preBegin])
break;
}
left = i - vinBegin;
root->left = reConstructBinaryTree_Core(pre, vin, preBegin+1, preBegin+left, vinBegin, i-1);
root->right = reConstructBinaryTree_Core(pre, vin, preBegin+left+1, preEnd, i+1, vinEnd);
return root;
}
TreeNode* reConstructBinaryTree(vector<int> pre,vector<int> vin) {
int length = pre.size();
return reConstructBinaryTree_Core(pre, vin, 0, length-1, 0, length-1);
}
};