589. N-ary Tree Preorder Traversal
基操。但是迭代的怎么写呢?
class Solution {
public:
vector<int> preorder(Node* root) {
vector<int> path;
_preorder(root,path);
return path;
}
void _preorder(Node* root,vector<int>& path){
if(root==NULL)
return;
path.push_back(root->val);
for(auto x:root->children)
_preorder(x,path);
}
};