python剑指offer系列层序遍历二叉树

class Solution:
    # 返回从上到下每个节点值列表，例：[1,2,3]
    def PrintFromTopToBottom(self, root):
        lists = []
        if root == None:
            return
        que1 = []
        que1.append(root)

        while que1:
            data = que1.pop(0)
            if data.left != None:
                que1.append(data.left)
            if data.right != None:
                que1.append(data.right)

            lists.append(data.val)
        return lists

借助一个队列就可以轻松解决