面试题23：从上往下打印二叉树（python）

面试题23：从上往下打印二叉树

class BinaryTreeNode():
    def __init__(self,value,left,right):
        self.value=value
        self.left=left
        self.right=right

import collections as cts 
def PrintFromToBottom(pTreeRoot):
    if pTreeRoot is None:
        return 
    newqueue=cts.deque()
    newqueue.append(pTreeRoot)
    while len(newqueue)!=0:
        pnode=newqueue.popleft()
        print(pnode.value)
        if pnode.left:
            newqueue.append(pnode.left)
        if pnode.right:
            newqueue.append(pnode.right)