python实现二叉树

废话不多说，直接上代码

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


class Node(object):
    ##
    # 节点类
    # 初始化节点
    # #
    def __init__(self, element, lchild=None, rchild=None):
        self.element = element
        self.lchild = lchild
        self.rchild = rchild


class Tree(object):
    ##
    # 树类
    # 初始化节点
    # #
    def __init__(self, root=None,queue=[]):
        self.root = root
        self.queue=queue
    # 添加节点

    def addDefault(self,item):
        """
        默认添加子树，优先添加金字塔高层节点的左子节点
        :param item:
        :return:
        """
        node = Node(item)
        if(self.root is None):
            self.root = node
            self.queue.append(self.root)
            return
        else:
            self.queue.append(node)
            min=len(self.queue)
            for i in self.queue:  #找到最小值
                if((i.lchild is None) or (i.rchild is None)):
                    index = self.queue.index(i)
                    if(index<min):
                        min=index
            cur_node = self.queue[min]
            if(cur_node.lchild is None):
                cur_node.lchild = node
                return
            elif(cur_node.rchild is None):
                cur_node.rchild = node
                return

    def addAppoint(self,item,element):
        """
        指定添加节点，将item添加到指定element的node下
        :param item:
        :param node:
        :return:
        """
        tag_node=None
        node=self.isHasNode(element)
        if(node!=False):
                tag_node=node
        if(tag_node is not None):
            if(tag_node.lchild is None):
                tag_node.lchild=Node(item)
                self.queue.append(Node(item))
            elif(tag_node.rchild is None):
                tag_node.rchild = Node(item)
                self.queue.append(Node(item))

    def isHasNode(self,element):
        """
        判断是否存在元素为element的节点，存在返回该节点，反之返回False
        :param element:
        :return:
        """
        flag=False
        for node in self.queue:
            if(node.element==element):
                return node
        return flag

    def getlchild(self,element):
        """
        获取元素为element的节点的左子节点
        :param element:
        :return:
        """
        tag_node = None
        node = self.isHasNode(element)
        if (node != False):
            tag_node = node
            if (tag_node is not None):
                if (tag_node.lchild is not None):
                    return tag_node.lchild.element
                else:
                    return None
            else:
                return None
        else:
            return None

    def getrchild(self,element):
        """
        获取元素为element的节点的右子节点
        :param element:
        :return:
        """
        tag_node = None
        node = self.isHasNode(element)
        if (node != False):
            tag_node = node
            if (tag_node is not None):
                if (tag_node.rchild is not None):
                    return tag_node.rchild.element
                else:
                    return None
            else:
                return None
        else:
            return None

    def getfather(self,element):
        """
        获取元素为element的节点的父节点
        :param element:
        :return:
        """
        tag_node = None
        node = self.isHasNode(element)
        if (node != False):
            tag_node = node
            for i in self.queue:
                if(i.lchild==tag_node or i.rchild==tag_node):
                    return i.element
        return None


if __name__ == '__main__':
    t = Tree()
    t.addDefault(0)
    t.addDefault(1)
    t.addDefault(2)
    t.addDefault(3)
    t.addDefault(4)
    t.addAppoint(10,2)
    print(t.root.element)
    print(t.root.lchild.element)
    print(t.root.rchild.element)
    print(t.root.rchild.lchild.element)
    print(t.getfather(5))