Construct Binary Tree from Inorder and Postorder Traversal

这题应该算比较常见的题目了，基本的数据结构题目；递归构建每棵子树，唯一需要注意的是计算左子树的根节点在postorder的下标。

class Solution {
public:
    //递归建树
    unordered_map<int, int> InMap;
    void BuildSubTree(vector<int> &inorder, vector<int> &postorder, int postIndex, int low, int high, TreeNode *&root)
    {
        if(low > high || postIndex < 0) //子树不存在
        {
            return;
        }
        
        root = new TreeNode(postorder[postIndex]);
        if(low == high) //子树没有左右子树,为叶结点
        {
            return;
        }
        
        int inIndex = InMap[postorder[postIndex]];
        BuildSubTree(inorder, postorder, postIndex - 1, inIndex + 1, high, root->right); //构造右子树
        BuildSubTree(inorder, postorder, postIndex - (high - inIndex + 1), low, inIndex - 1, root->left); //构造左子树
    }
    
    TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
        int lenIn = inorder.size();
        int lenPost = postorder.size();
        if(lenIn < 1 || lenPost < 1 || lenIn != lenPost)
        {
            return NULL;
        }
        
        for(int i = 0; i < lenIn; ++i)
        {
            InMap[inorder[i]] = i;
        }
        TreeNode *root = NULL;
        BuildSubTree(inorder, postorder, lenPost - 1, 0, lenIn - 1, root);
        return root;
    }
};