剑指 Offer 07. 重建二叉树
输入某二叉树的前序遍历和中序遍历的结果,请重建该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。
例如,给出
前序遍历 preorder = [3,9,20,15,7]
中序遍历 inorder = [9,3,15,20,7]
返回如下的二叉树:
3
/
9 20
/
15 7
题解:用递归找中序的位置。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
vector<int>preorder_1;
vector<int>inorder_1;
map<int,int>mp;
public:
TreeNode* buildTree_1(int l_pre,int r_pre,int l_in,int r_in){
if(r_in-l_in<0){
return NULL;
}
TreeNode *root=new TreeNode(preorder_1[l_pre]);
int inorderindex=mp[preorder_1[l_pre]];
int nums_left = inorderindex-l_in;
int nums_right = r_in-inorderindex;
root->left=buildTree_1(l_pre+1,l_pre+nums_left,l_in,inorderindex-1);
root->right=buildTree_1(l_pre+nums_left+1,r_pre,inorderindex+1,r_in);
return root;
}
TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
preorder_1=preorder;
inorder_1=inorder;
int end =0;
end=preorder.size();
for(int i=0 ;i<inorder.size();i++){
mp[inorder[i]]=i;
}
TreeNode* root=buildTree_1(0,end-1,0,end-1);
return root;
}
};