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

藉助一個隊列就可以輕鬆解決