【题目】
传送门
【代码】
/*
// 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<int>res;
void helper(Node*root)
{
if(!root)
return;
res.push_back(root->val);
for(int i=0;i<root->children.size();i++)
helper(root->children[i]);
}
vector<int> preorder(Node* root) {
if(root==nullptr)
return res;
helper(root);
return res;
}
};