Time: 20 ms (10.92%), Space: 15.7 MB (15.31%) - LeetHub

Author: MishkatIT

0429-n-ary-tree-level-order-traversal/0429-n-ary-tree-level-order-traversal.cpp

@@ -0,0 +1,43 @@
+/*
+// Definition for a Node.
+class Node {
+public:
+    int val;
+    vector<Node*> children;
+
+    Node() {}
+
+    Node(int _val) {
+        val = _val;
+    }
+
+    Node(int _val, vector<Node*> _children) {
+        val = _val;
+        children = _children;
+    }
+};
+*/
+
+class Solution {
+public:
+    vector<vector<int>> levelOrder(Node* root) {
+        vector<vector<int>> ans;
+        if (!root) return ans;
+        queue<Node*> q;
+        q.push(root);
+        while (!q.empty()) {
+            int sz = q.size();
+            vector<int> level;
+            for (int i = 0; i < sz; i++) {
+                Node* cur = q.front();
+                q.pop();
+                level.push_back(cur->val);
+                for (auto& child : cur->children) {
+                    if (child) q.push(child);
+                }
+            }
+            ans.push_back(level);
+        }
+        return ans;
+    }
+};