python - 데이터 구조 - 코드 가 이 진 트 리 를 옮 겨 다 니 는 것 을 실현 합 니 다.

class Node:
    """   """

    def __init__(self, item):
        self.item = item
        self.lchild = None
        self.rchild = None

class BinaryTree:
    """   """

    def __init__(self, node=None):
        self.root = node

    def add(self, item):
        """            """
        if self.root is None:
            self.root = Node(item)
        else:
            queue = []
            queue.append(self.root)

            while True:
                node = queue.pop(0)
                if not node.lchild:
                    node.lchild = Node(item)
                    return
                else:
                    queue.append(node.lchild)
                if not node.rchild:
                    node.rchild = Node(item)
                    return
                else:
                    queue.append(node.rchild)

def breadh_travel(self):
        """      """
        if self.root is None:
            return
        queue = []
        queue.append(self.root)
        while len(queue) > 0:
            node = queue.pop(0)
            print(node.item, end=" ")
            if node.lchild:
                queue.append(node.lchild)
            if node.rchild:
                queue.append(node.rchild)

def preorder_trval(self, root):
        """        """
        if root:
            print(root.item, end="")
            self.preorder_trval(root.lchild)
            self.preorder_trval(root.rchild)

    def inorder(self, root):
        """        """
        if root:
            self.inorder(root.lchild)
            print(root.item, end="")
            self.inorder(root.rchild)

    def postorder_trval(self, root):
        """         """
        if root:
            self.postorder_trval(root.lchild)
            self.postorder_trval(root.rchild)
            print(root.item, end="")

if __name__ == '__main__':
    tree = BinaryTree()
    tree.add(0)
    tree.add(1)
    tree.add(2)
    tree.add(3)
    tree.add(4)
    tree.add(5)
    tree.add(6)
    tree.add(7)
    tree.add(8)
    tree.add(9)
    tree.breadh_travel()
    print("")
    tree.preorder_trval(tree.root)
    print("")
    tree.inorder(tree.root)
    print("")
    tree.postorder_trval(tree.root)
    print("")