top面试105.从前序与中序遍历序列构造二叉树-CSDN博客

本文链接：https://blog.csdn.net/carolineme/article/details/107760867

题目描述：

思路：递归，找出根节点，左子树，右子树，继续在左子树中找出根节点，左子树，右子树，右子树中找出根节点，左子树，右子树。

/**
 * 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 {
private:
    //中序遍历的映射，快速找到根节点
    unordered_map<int,int>index;
public:
    //参数依次为前序遍历，中序遍历，前序遍历数组的左端点，前序遍历数组的右端点，中序遍历数组的左端点，中序遍历数组的右端点
    TreeNode *myBuildTree(vector<int>& preorder, vector<int>& inorder,int preorder_left,int preorder_right,int inorder_left,int inorder_right){
        if (preorder_left > preorder_right) {
            return nullptr;
        }
        int preorder_root=preorder_left;
        int inorder_root=index[preorder[preorder_root]];
        //新建根节点
        TreeNode *root=new TreeNode(preorder[preorder_root]);
        int size_left_subtree=inorder_root-inorder_left;
        //递归求左子树
        root->left = myBuildTree(preorder, inorder, preorder_left + 1, preorder_left + size_left_subtree, inorder_left, inorder_root - 1);
        //递归求右子树
        root->right = myBuildTree(preorder, inorder, preorder_left + size_left_subtree + 1, preorder_right, inorder_root + 1, inorder_right);
        return root;

    }
    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
        int n=preorder.size();
        for(int i=0;i<n;i++){
            index[inorder[i]]=i;
        }
        return myBuildTree(preorder,inorder,0,n-1,0,n-1);
    }
};