重建二叉树 牛客网 剑指Offer
题目描述输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{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.left = None # self.right = None class Solution: #run:60ms memory:5624k def reConstructBinaryTree(self, pre, tin): if 0 == len(pre): return None ret = TreeNode(pre[0]) ret.left = self.reConstructBinaryTree(pre[1: tin.index(pre[0]) + 1], tin[: tin.index(pre[0])]) ret.right = self.reConstructBinaryTree(pre[tin.index(pre[0]) + 1: ], tin[tin.index(pre[0]) + 1: ]) return ret
转载于:https://www.cnblogs.com/vercont/p/10210351.html
