二叉树构造及各种遍历

class Node(object):
    '''节点'''
    def __init__(self,elem):
        self.data = elem
        self.lchild = None
        self.rchild = None

class Tree(object):
    '''二叉树'''
    def __init__(self):
        self.root = None

    def add(self,item):
        node = Node(item)
        queue = []
        if self.root is None:
            self.root = node
            return
        queue.append(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 breath_traval(self):
        '''广度优先遍历'''
        if self.root is None:
            return
        queue = [self.root]
        while queue:
            cur_node = queue.pop(0)
            print(cur_node.data,end=' ')
            if cur_node.lchild is not None:
                queue.append(cur_node.lchild)
            if cur_node.rchild is not None:
                queue.append(cur_node.rchild)

    def pre_order(self,node):
        '''前序遍历'''
        if node is None:
            return
        print(node.data,end=' ')
        self.pre_order(node.lchild)
        self.pre_order(node.rchild)

    def mid_order(self,node):
        '''中序遍历'''
        if node is None:
            return
        self.mid_order(node.lchild)
        print(node.data, end=' ')
        self.mid_order(node.rchild)

    def post_order(self,node):
        '''后续遍历'''
        if node is None:
            return
        self.post_order(node.lchild)
        self.post_order(node.rchild)
        print(node.data, end=' ')

if __name__ == '__main__':
    tree = Tree()
    tree.add(1)
    tree.add(2)
    tree.add(3)
    tree.add(4)
    tree.add(5)
    tree.breath_traval()
    print('\n')
    tree.pre_order(tree.root)
    print('\n')
    tree.mid_order(tree.root)
    print('\n')
    tree.post_order(tree.root)