《剑指offer》之重建二叉树（python实现）

 

问题描述：

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

参考网上其他小伙伴的解答方案用以下代码解题，两种方式略有差别。（感慨大牛思路666，自己 写了几十行代码没搞定，还是参考了网上代码思路。）

 

# -*- 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
        tree = TreeNode(pre.pop(0))
        index = tin.index(tree.val)
        tree.left = self.reConstructBinaryTree(pre, tin[:index])
        tree.right = self.reConstructBinaryTree(pre, tin[index + 1:])
        return tree

# -*- 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 pre == [] or tin == []:
            return None
        tree = TreeNode(pre[0])
        index = tin.index(tree.val)
        tree.left = self.reConstructBinaryTree(pre[1:index +1 ], tin[:index])
        tree.right = self.reConstructBinaryTree(pre[index + 1:], tin[index + 1:])
        return tree