【树】后序和中序遍历建立二叉树

一、题目

. - 力扣（LeetCode）. - 备战技术面试？力扣提供海量技术面试资源，帮助你高效提升编程技能,轻松拿下世界 IT 名企 Dream Offer。https://leetcode.cn/problems/construct-binary-tree-from-inorder-and-postorder-traversal/

二、题解

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution 
{
public:
    map<int, int> hash;

    TreeNode* dfs(vector<int>& inorder, vector<int>& postorder, int pl, int pr, int il, int ir) 
    {
        if (pl > pr) return nullptr;

        TreeNode* root = new TreeNode(postorder[pr]);
        int inorder_root_idx = hash[postorder[pr]], right_tree_sz = ir - inorder_root_idx;

        root->left = dfs(inorder, postorder, pl, pr - right_tree_sz - 1, il, inorder_root_idx - 1);
        root->right = dfs(inorder, postorder, pr - right_tree_sz, pr - 1, inorder_root_idx + 1, ir);
        
        return root;
    }

    TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) 
    {
        int n = inorder.size();
        for (int i = 0; i < n; i++) hash[inorder[i]] = i;

        return dfs(inorder, postorder, 0, n - 1, 0, n - 1);
    }
};