leecode105. Construct Binary Tree from Preorder and Inorder Traversal先序中序重建树

leecode105. Construct Binary Tree from Preorder and Inorder Traversal先序中序重建树
For example, given

preorder = [3,9,20,15,7]
inorder = [9,3,15,20,7]
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, preorder: List[int], inorder: List[int]) -> TreeNode:
        if inorder:
            ind=inorder.index(preorder.pop(0))
            root=TreeNode(inorder[ind])
            root.left=self.buildTree(preorder,inorder[:ind])
            root.right=self.buildTree(preorder,inorder[ind+1:])
            return root