1
0
Fork 0
mirror of https://gitlab.com/mfocko/LeetCode.git synced 2024-11-14 09:59:41 +01:00
LeetCode/problems/n-ary-tree-preorder-traversal.cpp

44 lines
696 B
C++
Raw Normal View History

/*
// 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 {
void preorder(vector<int>& traversal, Node* root)
{
if (root == nullptr) {
return;
}
traversal.push_back(root->val);
for (auto child : root->children) {
preorder(traversal, child);
}
}
public:
vector<int> preorder(Node* root)
{
vector<int> result;
preorder(result, root);
return result;
}
};