parameters: (self, root)
return_statement: return result
docstring: :type root: Node
          :rtype: List[List[int]]
docstring_summary: :type root: Node
          :rtype: List[List[int]]
docstring_tokens: : type root : Node : rtype : List [ List [ int ]]
function: def levelOrder(self, root):
          """
          :type root: Node
          :rtype: List[List[int]]
          """
          if not root:
              return []
          result, q = [], [root]
          while q:
              result.append([node.val for node in q])
              q = [child for node in q for child in node.children if child]
          return result
function_tokens: def levelOrder ( self , root ) : if not root : return [ ] result , q = [ ] , [ root ] while q : result . append ( [ node . val for node in q ] ) q = [ child for node in q for child in node . children if child ] return result