通过前序遍历和中序遍历构建二叉树 python实现

客官°小女子只卖身不卖艺 2022-05-23 08:58 117阅读 0赞

# 前言 #

通过前序遍历和中序遍历构建二叉树的原理，主要是找前序遍历根节点在中序遍历中的位置，然后将二叉树而成左子树和右子树，然后依次进行这样的操作,思路还是比较简单的

# 代码 #

class Node:
        def __init__(self, data, left, right):
            self.data = data
            self.left = left
            self.right = right
    
    
    def construct_tree(pre_order, mid_order):
        # 忽略参数合法性判断
        if len(pre_order) == 0:
            return None
        # 前序遍历的第一个结点一定是根结点
        root_data = pre_order[0]
        i = mid_order.index(root_data)
        # 递归构造左子树和右子树
        left = construct_tree(pre_order[1: 1 + i], mid_order[:i])
        right = construct_tree(pre_order[1 + i:], mid_order[i + 1:])
        return Node(root_data, left, right)

# 如果加上遍历 #

这里以层次遍历来遍历二叉树

# coding:utf-8
    
    # !/usr/bin/env python
    
    # Time: 2018/6/6 9:02
    
    # Author: sty
    
    # File: construct_tree.py
    
    
    class Node:
        def __init__(self, data, left, right):
            self.data = data
            self.left = left
            self.right = right
    
    
    def construct_tree(pre_order, mid_order):
        # 忽略参数合法性判断
        if len(pre_order) == 0:
            return None
        # 前序遍历的第一个结点一定是根结点
        root_data = pre_order[0]
        i = mid_order.index(root_data)
        # 递归构造左子树和右子树
        left = construct_tree(pre_order[1: 1 + i], mid_order[:i])
        right = construct_tree(pre_order[1 + i:], mid_order[i + 1:])
        return Node(root_data, left, right)
    
    def levelOrder(root):
        """ 普通二叉树层次遍历，并输出 :type root: TreeNode :rtype: List[List[int]] """
        res, level = [], [root]
        while root and level:
            currentNode = []
            nextLevel = []
            for node in level:
                currentNode.append(node.data)
                if node.left:
                    nextLevel.append(node.left)
                if node.right:
                    nextLevel.append(node.right)
            res.append(currentNode)
            level = nextLevel
        return res
    
    if __name__ == '__main__':
        pre_order = [1, 2, 4, 7, 3, 5, 6, 8]
        mid_order = [4, 7, 2, 1, 5, 3, 8, 6]
        root = construct_tree(pre_order, mid_order)
        print(levelOrder(root))
        print root.data
        print root.left.data
        print root.right.data
        print root.left.left.data
        print root.right.left.data
        print root.right.right.data
        print root.left.left.right.data
        print root.right.right.left.data