重建二叉树

# 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 not preorder or not inorder:
            return None
        if len(preorder) != len(inorder):
            return None

        root = preorder[0] # root node
        rootNode = TreeNode(root) # construct the tree 
        pos = inorder.index(root) # get the index of root

        inorder_left = inorder[:pos] # left part of inorder
        inorder_right = inorder[pos+1:] # right part of inorder

        preorder_left = preorder[1: pos+1] # left part of preorder
        preorder_right = preorder[pos+1:] # right part of preorder
        
        node_left = self.buildTree(preorder_left, inorder_left) # construct the left part
        node_right = self.buildTree(preorder_right, inorder_right) # construct the right part

        rootNode.left = node_left
        rootNode.right = node_right

        return rootNode