def buildTree(self, inorder, postorder):
        """
        :type inorder: List[int]
        :type postorder: List[int]
        :rtype: TreeNode
        """
        n = len(inorder)
        inOrderMap = {inorder[i]: i for i in range(n)}
        return self.buildTreeUtil(inorder, postorder, inOrderMap, 0, n - 1, 0, n - 1)

        :type inorder: List[int]
        :type postorder: List[int]
        :rtype: TreeNode
        
python/106_Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal.py