二叉树广度遍历实现

# 二叉树连接表的实现
class note():
    def __init__(self,data,l=None,r=None):
        self._d=data
        self._left = l
        self._right=r

    def count_note(self,t):
        if t is None:
            return 0
        else:
            return 1+self.count_note(t._left)\
                   +self.count_note(t._right)
        
    def sum_note(self,t):
        if t is None:
            return 0
        else:
            return t._d+self.sum_note(t._left)\
                   +self.sum_note(t._right)
#########
# 层次遍历
# 顺序表实现固定容量的队列结构
class Queuelist():
    
    def __init__(self,max_len=20): 
        self._inpoint = -1
        self._outpoint = -1
        self._Queue = list(range(max_len))
        self._max_len = max_len
                           
    def inqueue(self,x):
        if self._inpoint ==self._max_len-2:
            self._inpoint = -2
        if (self._inpoint +1)==self._outpoint:
            raise Exception("队列已满！！！")
        if self._inpoint == -2:
            self._inpoint=-1
        self._inpoint += 1
        self._Queue[self._inpoint]=x
        
    def outqueue(self):
        if not self._inpoint==self._outpoint:
            if self._outpoint ==self._max_len-2:
                self._outpoint = -2
            if self._inpoint == -2:
                self._inpoint=-1
            self._outpoint += 1
            if self._outpoint == -1:
                print('队列为空')
            else:
                return self._Queue[self._outpoint]
        else:
            print("队列为空，无法出队")
        
    def is_full(self):
        return (self._inpoint+1)==self._outpoint
    
    def is_empty(self):
        return self._inpoint==self._outpoint

def peek_all_first(t):   # 问题：层次遍历遇到列举，怎么转换为自动循环
    que=Queuelist()
    que.inqueue(t)
    while not que.is_empty():# 答：利用返回的节点，而单纯的节点数据来迭代找到下一个入队节点
        t0=que.outqueue()
        if isinstance(t0,note):
            print(t0._d)
            que.inqueue(t0._left)
            que.inqueue(t0._right)
        else:
            print(t0)
    
t =note( 'A',note('B','D','E'),'C') 
peek_all_first(t)
#################################################################################################