根据先历和中历结果构建二叉树

根据先历和中历结果构建二叉树

例子：先历[1,2,3,4],中历[1,2,3,4]
二叉树[1 # 2 # 3 # 4 #]

   def reConstructBinaryTree(self, pre, tin):
       # write code here
       head = TreeNode(pre[0])
       if len(pre) == 1:
           return head
       temp = tin.index(pre[0])
       if temp > 0:
           head.left = self.reConstructBinaryTree(pre[1:temp+1],tin[:temp])
       if temp+1 < len(tin):
           head.right = self.reConstructBinaryTree(pre[temp+1:],tin[temp+1:])
       return head