Python 重建二叉树

输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如，输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，则重建二叉树并返回。

class TreeNode:
    def __init__(self, x):
        self.val = x
        self.next = None


class Solution:
    def reConstructBinary(self, pre, tin):
        if not pre or not tin:
            return None
        if len(pre) != len(tin):
            return None
        root = pre[0]
        rootNode = TreeNode(root)
        pos = tin.index(root)

        tinLeft = tin[:pos]
        tinRight = tin[pos + 1:]

        preLeft = pre[1:pos + 1]
        preRight = pre[pos + 1:]

        leftNode = self.reConstructBinary(preLeft, tinLeft)
        rightNode = self.reConstructBinary(preRight, tinRight)

        if leftNode:
            rootNode.left = leftNode
        if rightNode:
            rootNode.right = rightNode
        return rootNode