106Construct Binary Tree from Inorder and Postorder Traversal

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution(object):
    def buildTree(self, inorder, postorder):
        """
        :type inorder: List[int]
        :type postorder: List[int]
        :rtype: TreeNode
        """
        if not inorder or not postorder:
            return None
        ind=inorder.index(postorder.pop())
        root=TreeNode(inorder[ind])
        root.right=self.buildTree(inorder[ind+1:],postorder)
        root.left=self.buildTree(inorder[:ind],postorder)
        

        return root

给定中序和后序，先移除右再移除左