# -*- coding: utf-8 -*-

# @Time : 2019/5/1 19:16

# @Author : Scavenger

# @FileName: tree.py

# @Software: PyCharm

# @Github : https://github.com/dgfwork/

# @Blog : https://www.cnblogs.com/gaofeng-d/

class Node(object):

def __init__(self, elem):

self.elem = elem

self.rchild = None

self.lchild = None

class Tree(object):

def __init__(self):

self.root = None

def add(self, elem):

node = Node(elem)

if self.root is None:

self.root = node

return

queue = [self.root]

while queue:

cur_node = queue.pop(0)

if cur_node.lchild is None:

cur_node.lchild = node

return

else:

queue.append(cur_node.lchild)

if cur_node.rchild is None:

cur_node.rchild = node

return

else:

queue.append(cur_node.rchild)

def breadth_travel(self):

if self.root is None:

return

else:

queue = [self.root]

while queue:

cur_node = queue.pop(0)

print(cur_node.elem, end=" ")

if cur_node.lchild:

queue.append(cur_node.lchild)

if cur_node.rchild:

queue.append(cur_node.rchild)

def preorder(self, node):

if node == None:

return

else:

print(node.elem, end=" ")

self.preorder(node.lchild)

self.preorder(node.rchild)

def inorder(self, node):

if node == None:

return

else:

self.inorder(node.lchild)

print(node.elem, end=" ")

self.inorder(node.rchild)

def postorder(self, node):

if node == None:

return

else:

self.postorder(node.lchild)

self.postorder(node.rchild)

print(node.elem, end=" ")

if __name__ == "__main__":

tree = Tree()

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.breadth_travel()

print("")

tree.preorder(tree.root)