Add question

Author: gahogg

N-ary Tree Level Order Traversal/N-ary Tree Level Order Traversal - Leetcode 429.cpp renamed to N-ary Tree Level Order Traversal - Leetcode 429/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 renamed to N-ary Tree Level Order Traversal - Leetcode 429/N-ary Tree Level Order Traversal - Leetcode 429.java

@@ -0,0 +1,18 @@
+import java.util.*;
+
+
+class Solution {
+    public List<Integer> preorder(Node root) {
+        List<Integer> output = new ArrayList<>();
+        if (root == null) return output;
+        dfs(root, output);
+        return output;
+    }
+
+    private void dfs(Node node, List<Integer> output) {
+        output.add(node.val);
+        for (Node child : node.children) {
+            dfs(child, output);
+        }
+    }
+}

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

@@ -0,0 +1,15 @@
+var preorder = function(root) {
+    if (!root) return [];
+
+    let output = [];
+    
+    function dfs(node) {
+        output.push(node.val);
+        for (let child of node.children) {
+            dfs(child);
+        }
+    }
+
+    dfs(root);
+    return output;
+};

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

@@ -0,0 +1,25 @@
+"""
+# 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 preorder(self, root: 'Node') -> List[int]:
+        if not root:
+            return []
+
+        output = []
+        def dfs(node):
+            output.append(node.val)
+            for child in node.children:
+                dfs(child)
+        
+        dfs(root)
+        return output
+
+        # Time: O(n)
+        # Space: O(n)
+        # n is number of nodes in the tree