题目描述
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建二叉树并返回。
解题思路
从前序第一个元素中可以找到根节点,并根据根节点在中序中找到左右子树,并一次递归子树寻找。(pop这个方法很好用,我在网上看来的)
代码
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
# 返回构造的TreeNode根节点
def reConstructBinaryTree(self, pre, tin):
# write code here
if not pre or not tin:
return None
root = TreeNode(pre.pop(0))
index = tin.index(root.val)
root.left = self.reConstructBinaryTree(pre, tin[:index])
root.right = self.reConstructBinaryTree(pre, tin[index + 1:])
return root
附加:
另外,若遇到中序和后序进行重建时,应是
代码
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
# 返回构造的TreeNode根节点
def reConstructBinaryTree(self, rea, tin):
# write code here
if not rea or not tin:
return None
root = TreeNode(rea(-1))
index = tin.index(root.val)
root.left = self.reConstructBinaryTree(rea[0:index], tin[:index])
root.right = self.reConstructBinaryTree(rea[index:-1], tin[index + 1:])
return root