add question

Author: gahogg

N-ary Tree Level Order Traversal/N-ary Tree Level Order Traversal - Leetcode 429.cpp

@@ -0,0 +1,30 @@
+#include <vector>
+#include <queue>
+
+using namespace std;
+
+class Solution {
+public:
+    vector<vector<int>> levelOrder(Node* root) {
+        vector<vector<int>> output;
+        if (!root) return output;
+
+        queue<Node*> q;
+        q.push(root);
+
+        while (!q.empty()) {
+            int n = q.size();
+            vector<int> level;
+            for (int i = 0; i < n; i++) {
+                Node* node = q.front();
+                q.pop();
+                level.push_back(node->val);
+                for (Node* child : node->children) {
+                    q.push(child);
+                }
+            }
+            output.push_back(level);
+        }
+        return output;
+    }
+};

N-ary Tree Level Order Traversal/N-ary Tree Level Order Traversal - Leetcode 429.java

@@ -0,0 +1,26 @@
+import java.util.*;
+
+
+class Solution {
+    public List<List<Integer>> levelOrder(Node root) {
+        List<List<Integer>> output = new ArrayList<>();
+        if (root == null) return output;
+
+        Queue<Node> q = new LinkedList<>();
+        q.add(root);
+
+        while (!q.isEmpty()) {
+            int n = q.size();
+            List<Integer> level = new ArrayList<>();
+            for (int i = 0; i < n; i++) {
+                Node node = q.poll();
+                level.add(node.val);
+                if (node.children != null) {
+                    q.addAll(node.children);
+                }
+            }
+            output.add(level);
+        }
+        return output;
+    }
+}

N-ary Tree Level Order Traversal/N-ary Tree Level Order Traversal - Leetcode 429.js

@@ -0,0 +1,20 @@
+var levelOrder = function(root) {
+    if (!root) return [];
+
+    let output = [];
+    let q = [root];
+
+    while (q.length > 0) {
+        let n = q.length;
+        let level = [];
+        for (let i = 0; i < n; i++) {
+            let node = q.shift();
+            level.push(node.val);
+            if (node.children) {
+                q.push(...node.children);
+            }
+        }
+        output.push(level);
+    }
+    return output;
+};

N-ary Tree Level Order Traversal/N-ary Tree Level Order Traversal - Leetcode 429.py

@@ -0,0 +1,31 @@
+"""
+# Definition for a Node.
+class Node:
+    def __init__(self, val: Optional[int] = None, children: Optional[List['Node']] = None):
+        self.val = val
+        self.children = children
+"""
+
+class Solution:
+    def levelOrder(self, root: 'Node') -> List[List[int]]:
+        if not root:
+            return []
+        output = []
+        q = deque()
+        q.append(root)
+
+        while q:
+            n = len(q)
+            level = []
+            for _ in range(n):
+                node = q.popleft()
+                level.append(node.val)
+                for child in node.children:
+                    q.append(child)
+            output.append(level)
+        
+        return output
+
+        # Time: O(n)
+        # Space: O(n)
+        # n is number of nodes in the tree