Leetcode刷题记录——剑指 Offer 32 - I. 从上到下打印二叉树

队列

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def __init__(self):
        self.res = []
        self.length = 0
    def levelOrder(self, root: TreeNode) -> List[int]:
        if root == None:
            return []
        stack = [root]
        while stack != []:
            this = stack.pop(0)
            if this.left != None:
                stack.append(this.left)
            if this.right != None:
                stack.append(this.right)
            self.res.append(this.val)

        return self.res