python二叉树的遍历

"""
二叉树遍历
思路分析：
    利用递归函数实现二叉树的先序，中序，后序
    利用队列实现二叉树的层次遍历
"""
from lqueue import *


# 节点类
class Node:
    def __init__(self, val, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right


# 二叉树的根节点
class CrossTree:
    def __init__(self, root):
        self.root = root

    # 先序遍历
    def beforeOrder(self, node):
        # 终止条件
        if node is None:
            return
        print(node.val)
        self.beforeOrder(node.left)
        self.beforeOrder(node.right)

    # 中序遍历
    def centerOrder(self, node):
        # 终止条件
        if node is None:
            return
        self.centerOrder(node.left)
        print(node.val)
        self.centerOrder(node.right)

    # 后序遍历
    def afterOrder(self, node):
        # 终止条件
        if node is None:
            return
        self.afterOrder(node.left)
        self.afterOrder(node.right)
        print(node.val)

    # 层次遍历
    # 让初始节点入队，谁出队就就遍历下面的子节点，并将子节点加入队列
    def levelOrder(self, node):
        lq = LQueue()
        lq.enqueue(node)
        while not lq.is_empty():
            node = lq.dequeue()
            print(node.val, end=" ")
            if node.left:
                lq.enqueue(node.left)
            if node.right:
                lq.enqueue(node.right)


if __name__ == "__main__":
    i = Node('I')
    h = Node('H')
    g = Node('G')
    f = Node('F')
    b = Node('B')
    e = Node('E', i, h)
    d = Node('D', f, g)
    c = Node('C', d, e)
    a = Node('A', b, c)
    # 传入根节点
    cs = CrossTree(a)
    cs.beforeOrder(cs.root)
    cs.levelOrder(a)