leedcode 从先序与中序遍历序列构造二叉树

# 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, preorder, inorder):
        """
        :type preorder: List[int]
        :type inorder: List[int]
        :rtype: TreeNode
        """
        if len(preorder) == 0:
            return None
        leftIn = []
        rightIn = []
        leftPre = []
        rightPre = []
        root = TreeNode(preorder[0])
        if len(preorder) == 1:
            return root
        location = 0
        while inorder[location] != root.val:
            leftIn.append(inorder[location])
            location += 1
        for i in range(1, location + 1):
            leftPre.append(preorder[i])
        for i in range(location + 1, len(preorder)):
            rightPre.append(preorder[i])
            rightIn.append(inorder[i])
        root.left = self.buildTree(leftPre, leftIn)
        root.right = self.buildTree(rightPre, rightIn)
        return root