Python构建二叉树及二叉树的五种遍历

最新推荐文章于 2025-04-28 17:38:06 发布

丶limit__

最新推荐文章于 2025-04-28 17:38:06 发布

阅读量2.5k

点赞数 1

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/LLM666Coder/article/details/79684278

本文介绍了二叉树的基本操作及多种遍历方法，包括前序遍历、中序遍历、后序遍历和深度优先遍历等，并提供了一个具体的二叉树实例及其遍历过程的代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

构建如图二叉树：

class node(object):
    def __init__(self, data=None, left=None, right=None):
        self.data = data
        self.left = left
        self.right = right
def depth(tree):
    if tree == None:
        return 0
    else:
        left, right = depth(tree.left), depth(tree.right)
        return max(left, right)+1
def pre_order(tree):
    if tree == None:
        return
    else:
        print tree.data
        pre_order(tree.left)
        pre_order(tree.right)
def mid_order(tree):
    if tree == None:
        return
    else:
        mid_order(tree.left)
        print tree.data
        mid_order(tree.right)
def post_order(tree):
    if tree == None:
        return
    else:
        post_order(tree.left)
        post_order(tree.right)
        print tree.data
#depth traverse
def depth_order(tree):
    if tree == None:
        return
    else:
        print tree.data
        if tree.left != None:
            depth_order(tree.left)
        if tree.right != None:
            depth_order(tree.right)
def level_order(tree):
    if tree == None:
        return
    else:
        stack = []
        stack.append(tree)
        while stack:
            current = stack.pop(0)
            print current.data
            if current.left != None:
                stack.append(current.left)
            if current.right != None:
                stack.append(current.right)
if __name__ == '__main__':
    tree = node('A', node('B', node('D'), node('E')), node('C'))
    print depth(tree)
    print pre_order(tree)
    print mid_order(tree)
    print post_order(tree)
    print depth_order(tree)
    print level_order(tree)