Python二叉树遍历算法

JHC000000

已于 2024-05-28 18:08:50 修改

阅读量497

点赞数 3

文章标签： python 算法开发语言

于 2024-05-28 18:08:33 首次发布

本文链接：https://blog.csdn.net/CXY00000/article/details/139274202

版权

# 定义一棵树结构
class Tree:
    def __init__(self, value):
        self.value = value
        self.left = None
        self.right = None


def zhong(tree, array=[]):
    """
    中序遍历
    :param tree: 
    :param array: 
    :return: 
    """
    if tree is None:
        return array
    zhong(tree.left, array)
    array.append(tree.value)
    zhong(tree.right, array)
    return array


def pre(tree, array=[]):
    """
    前序遍历
    :param tree: 
    :param array: 
    :return: 
    """
    if tree is None:
        return array
    array.append(tree.value)
    pre(tree.left, array)
    pre(tree.right, array)
    return array


def behind(tree, array=[]):
    """
    后序遍历
    :param tree: 
    :param array: 
    :return: 
    """
    if tree is None:
        return array
    behind(tree.left, array)
    behind(tree.right, array)
    array.append(tree.value)
    return array


# 按照给出的树，构建树形结构
tree = Tree(10)
tree.left = Tree(5)
tree.right = Tree(15)
tree.left.left = Tree(2)
tree.left.right = Tree(5)
tree.left.left.left = Tree(1)
tree.right.right = Tree(22)

print(zhong(tree, []))
print(behind(tree, []))
print(pre(tree, []))