leecode106. Construct Binary Tree from Inorder and Postorder Traversal中序后序重建树

leecode106. Construct Binary Tree from Inorder and Postorder Traversal中序后序重建树
For example, given

inorder = [9,3,15,20,7]
postorder = [9,15,7,20,3]
Return the following binary tree:
*** 3
*** / \
** 9 20
***** / \
*** 15 7

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def buildTree(self, inorder: List[int], postorder: List[int]) -> TreeNode:
        if not inorder or not postorder:
            return None
        root=TreeNode(postorder.pop())
        ind=inorder.index(root.val)
        
        root.right=self.buildTree(inorder[ind+1:],postorder)
        root.left=self.buildTree(inorder[:ind],postorder)
        
        return root