Python代码实现二叉树

二叉树

• 二叉树的遍历
  • 广度遍历：横向遍历
  • 深度遍历：纵向遍历（基于子树进行遍历）
    • 前序：根左右
    • 中序：左根右
    • 后序：左右根

python代码实现二叉树

# 代码实现二叉树
class Node:

    def __init__(self, item):
        self.item = item
        self.left = None  # 左节点
        self.right = None  # 右节点


class Tree:

    def __init__(self):
        self.root = None

    def insert(self, item):
        """ 插入数据 """
        node = Node(item)
        if self.root is None:
            """ 判断是一个空的树 """
            self.root = node
            return

        cur = self.root
        queue = [cur]  # 创建一个列表存放根节点
        while queue:
            pop_node = queue.pop(0)  # 每次取出一个根节点
            if pop_node.left is None:
                # 如果这个根节点的左叶子节点没有数据
                pop_node.left = node
                return
            else:
                # 如果这个根节点的左叶子节点有数据
                queue.append(pop_node.left)

            if pop_node.right is None:
                # 如果这个根节点的右叶子节点没有数据
                pop_node.right = node
                return
            else:
                # 如果这个根节点的右叶子节点有数据
                queue.append(pop_node.right)

    def travel(self):
        """ 广度遍历 """
        if self.root is None:
            return

        cur = self.root
        queue = [cur]
        while queue:
            pop_node = queue.pop(0)
            print(pop_node.item)
            if pop_node.left is not None:
                queue.append(pop_node.left)

            if pop_node.right is not None:
                queue.append(pop_node.right)

    def forward(self, root):
        """ 前序: 根左右 """
        if root is None:
            # 如果传入的根节点是空
            return

        print(root.item)  # 根
        self.forward(root.left)  # 左
        self.forward(root.right)  # 右

    def middle(self, root):
        """ 中序: 左根右 """
        if root is None:
            return

        self.middle(root.left)
        print(root.item)
        self.middle(root.right)

    def back(self, root):
        """ 中序: 左根右 """
        if root is None:
            return

        self.middle(root.left)
        self.middle(root.right)
        print(root.item)


tree = Tree()
tree.insert(1)
tree.insert(2)
tree.insert(3)
tree.insert(4)
tree.insert(5)
tree.insert(6)
tree.travel()
tree.forward(tree.root)
tree.middle(tree.root)
tree.back(tree.root)

python代码实现排序二叉树

# 代码实现排序二叉树
class Node:

    def __init__(self, item):
        self.item = item
        self.left = None  # 左节点
        self.right = None  # 右节点

        
class SortTree:

    def __init__(self):
        self.root = None

    def add(self, item):
        node = Node(item)

        if self.root is None:
            self.root = node
            return

        cur = self.root
        while cur:
            if item > cur.item:
                # 说明比根节点大，放右边
                if cur.right is None:
                    # 根的右节点为空
                    cur.right = node
                    return
                else:
                    cur = cur.right
            else:
                # 说明小于等于根节点，放左边
                if cur.left is None:
                    # 根的左节点
                    cur.left = node
                    return
                else:
                    cur = cur.left

    def middle(self, root):
        """ 使用中序出来的就是有序 """
        if root is None:
            return

        self.middle(root.left)
        print(root.item)
        self.middle(root.right)


sort_tree = SortTree()
lst = [2, 3, 5, 4, 1, 6, 23, 88, 66]
for i in lst:
    sort_tree.add(i)

sort_tree.middle(sort_tree.root)