102. Binary Tree Level Order Traversal

题目描述：

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

For example:
Given binary tree [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

 

return its level order traversal as:

[
  [3],
  [9,20],
  [15,7]
]

我的思路：

用栈保存记录，弹出时保存每层的结点值，并用一个list记录。

我的代码：

class Solution:
    def levelOrder(self, root):
        """
        :type root: TreeNode
        :rtype: List[List[int]]
        """
        if root is None:
            return []
        
        stack = [[root]]
        for level in stack:
            tmp_node = []
            for node in level:
                if node.left:    
                    tmp_node.append(node.left)
                if node.right:
                    tmp_node.append(node.right)
            if tmp_node:
                stack.append(tmp_node)
            
        return [[x.val for x in level] for level in stack]

Discuss：

class Solution:
    def levelOrder(self, root):
        """
        :type root: TreeNode
        :rtype: List[List[int]]
        """
        
        if not root:
            return []
        ans, level = [], [root]
        while level:
            ans.append([node.val for node in level])
            temp = []
            for node in level:
                temp.extend([node.left, node.right])
            level = [leaf for leaf in temp if leaf]
        return ans