这个问题的思路十分的简单,但是我在实现的时候的的确确出了问题,在参考其他人的答案的过程中,
"""
# Definition for a Node.
class Node:
def __init__(self, val=None, children=None):
self.val = val
self.children = children
"""
class Solution:
def levelOrder(self, root: 'Node') -> List[List[int]]:
q,ret=[root],[]
while any(q):
ret.append([node.val for node in q])
q=[child for node in q for child in node.children if child]
return ret;