day6_python实现二叉树的建树和遍历

节点类

# 节点类
class Node:
    def __init__(self, elem=-1, lchild=None, rchild=None):
        self.elem = elem
        self.lchild = lchild
        self.rchild = rchild

树类初始化

class Tree:
    def __init__(self, root=None):
        self.root = root
        self.queue = []

树类插入节点

    def insert_node(self, node):
        new_node = Node(node)
        if self.root is None:  # 只有第一次才进入，后面都不会进入，因为self.root 已经不为空
            self.root = new_node  # 对根节点赋值
            self.queue.append(new_node)  # 进入辅助队列
        else:  # 辅助队列建树
            tree_node = self.queue[0]
            if tree_node.lchild is None:
                tree_node.lchild = new_node
                self.queue.append(new_node)
            else:
                tree_node.rchild = new_node
                self.queue.append(new_node)
                self.queue.pop(0)  # 记得弹栈

树类前序、中序、后序递归遍历

 # 注： 千万不要在root前面加self,否则永远不会结束
    def front_digui(self, root):
        """利用递归实现树的先序遍历"""

        if root is None:
            return
        print(root.elem, end="")
        self.front_digui(root.lchild)
        self.front_digui(root.rchild)

    def middle_digui(self, root):
        """利用递归实现树的中序遍历"""

        if root is None:
            return
        self.middle_digui(root.lchild)
        print(root.elem, end="")
        self.middle_digui(root.rchild)

    def later_digui(self, root):
        """利用递归实现树的后序遍历"""

        if root is None:
            return
        self.later_digui(root.lchild)
        self.later_digui(root.rchild)
        print(root.elem, end="")

主函数

if __name__ == '__main__':
    tree = Tree()
    tree.insert_node(1)
    tree.insert_node(2)
    tree.insert_node(3)
    tree.insert_node(4)
    tree.insert_node(5)
    tree.insert_node(6)

    # 记得传入的是tree.root（根节点）
    tree.front_digui(tree.root)
    print("---前序")
    tree.middle_digui(tree.root)
    print("---中序")
    tree.later_digui(tree.root)
    print("---后序")

完整代码

# 节点类
class Node:
    def __init__(self, elem=-1, lchild=None, rchild=None):
        self.elem = elem
        self.lchild = lchild
        self.rchild = rchild


# 树类
class Tree:
    def __init__(self, root=None):
        self.root = root
        self.queue = []

    def insert_node(self, node):
        new_node = Node(node)
        if self.root is None:  # 只有第一次才进入，后面都不会进入，因为self.root 已经不为空
            self.root = new_node  # 对根节点赋值
            self.queue.append(new_node)  # 进入辅助队列
        else:  # 辅助队列建树
            tree_node = self.queue[0]
            if tree_node.lchild is None:
                tree_node.lchild = new_node
                self.queue.append(new_node)
            else:
                tree_node.rchild = new_node
                self.queue.append(new_node)
                self.queue.pop(0)  # 记得弹栈

    # 注： 千万不要在root前面加self,否则永远不会结束
    def front_digui(self, root):
        """利用递归实现树的先序遍历"""

        if root is None:
            return
        print(root.elem, end="")
        self.front_digui(root.lchild)
        self.front_digui(root.rchild)

    def middle_digui(self, root):
        """利用递归实现树的中序遍历"""

        if root is None:
            return
        self.middle_digui(root.lchild)
        print(root.elem, end="")
        self.middle_digui(root.rchild)

    def later_digui(self, root):
        """利用递归实现树的后序遍历"""

        if root is None:
            return
        self.later_digui(root.lchild)
        self.later_digui(root.rchild)
        print(root.elem, end="")


if __name__ == '__main__':
    tree = Tree()
    tree.insert_node(1)
    tree.insert_node(2)
    tree.insert_node(3)
    tree.insert_node(4)
    tree.insert_node(5)
    tree.insert_node(6)

    # 记得传入的是tree.root（根节点）
    tree.front_digui(tree.root)
    print("---前序")
    tree.middle_digui(tree.root)
    print("---中序")
    tree.later_digui(tree.root)
    print("---后序")

运行结果