Create n-ary-tree-level-order-traversal.py

Author: kamyu104

Python/n-ary-tree-level-order-traversal.py

@@ -0,0 +1,40 @@
+# Time:  O(n)
+# Space: O(w)
+
+# Given an n-ary tree, return the level order traversal of
+# its nodes' values. (ie, from left to right, level by level).
+#
+# For example, given a 3-ary tree:
+#
+# We should return its level order traversal:
+# [
+#      [1],
+#      [3,2,4],
+#      [5,6]
+# ]
+#
+# Note:
+# - The depth of the tree is at most 1000.
+# - The total number of nodes is at most 5000.
+
+
+# Definition for a Node.
+class Node(object):
+    def __init__(self, val, children):
+        self.val = val
+        self.children = children
+
+
+class Solution(object):
+    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