BeagleBone-Essentials-Harness-the-power-of-the-BeagleBone-Black-to-manage-external-environments-using-C-Bash-and-Python-PHP-programming.pdfBeagle Bone essentials
Copyright o 2015 Packt Publishi
ing
All rights reserved. No part of this book may be rep
输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，则重建二叉树并返回。
class Solution:
def reConstructBinaryTree(self, pre, tin):
if not pre or not tin:
return None
root
