class Solution:
def buildTree(self, preorder: List[int], inorder: List[int]) -> TreeNode:
if len(preorder) == 0 or len(inorder) == 0:
return
root = TreeNode(preorder[0])
mid = inorder.index(preorder[0])
#以mid为界划分中序
in_l = inorder[:mid]
in_r = inorder[mid+1:]
#根据中序划分前序
pre_l = preorder[1:1+len(in_l)]
pre_r = preorder[1+len(in_l):]
#递归构造左右子树
root.left = self.buildTree(pre_l, in_l)
root.right = self.buildTree(pre_r, in_r)
return root