数据结构与算法（十）：二叉树的python实现

二叉树的创建

二叉树的实现类似于链表的实现。有节点类和树类。
实现如下：
节点类

class Node(object):
    def __init__(self,item):
        self.elem = item
        self.lchild = None
        self.rchild = None

树类

class Tree(object):
    def __init__(self):
        self.root = None
        
    def add(self,item):
        """为树添加节点"""
        node = Node(item)
        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
        queue = [self.root]
        while queue:
            cur_node = queue.pop(0)
            print(cur_node.elem)
            if cur_node.lchild is not None:
                queue.append(cur_node.lchild)
            if cur_node.rchild is not None:
                queue.append(cur_node.rchild)
if __name__ == "__main__":
    tree = Tree()
    tree.add(1)
    tree.add(2)
    tree.add(3)
    tree.breadth_travel()

输出：

1
2
3

注：只有给出中序遍历和先序遍历，或者给出中序遍历和后序遍历，才能确定一棵树。