#300 Solution as on 18-02-2022 07:30 pm

Author: knockcat

0589. N-ary Tree Preorder Traversal. N-ary Tree Preorder Traversal.cpp

@@ -0,0 +1,24 @@
+// 589.✅ N-ary Tree Preorder Traversal
+
+class Solution
+{
+public:
+    void pre(Node *root, vector<int> &v)
+    {
+        if (root != NULL)
+        {
+            v.push_back(root->val);
+            for (auto child : root->children)
+                pre(child, v);
+        }
+    }
+
+    vector<int> preorder(Node *root)
+    {
+        vector<int> v;
+
+        pre(root, v);
+
+        return v;
+    }
+};