JZ22 从上往下打印二叉树 python

JZ22 从上往下打印二叉树

my version

from queue import Queue  
class TreeNode:
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None
class Solution:
    # 返回从上到下每个节点值列表，例：[1,2,3]
    def PrintFromTopToBottom(self, root):
        ret = []
        if root:
            q = Queue(maxsize=0)
            q.put(root)
            while not q.empty():
                node = q.get()
                if node:
                    ret.append(node.val)
                    q.put(node.left)
                    q.put(node.right)
        return ret