106

/**
 * 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 {
unordered_map<int, int> inorderIndex;
int curr = 0;
public:
    TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
        for(int i=0; i<inorder.size(); i++)
            inorderIndex[inorder[i]] = i;
        curr = inorder.size()-1;
        return constructTree(postorder, 0, inorder.size()-1);
    }

    TreeNode* constructTree(vector<int> &postorder, int left, int right){
        if(left > right) return NULL;

        int val = postorder[curr--];
        TreeNode *root = new TreeNode(val);

        root->right = constructTree(postorder, inorderIndex[val]+1, right);
        root->left = constructTree(postorder, left, inorderIndex[val]-1);
        return root;
    }

};