589. N叉树的前序遍历
/*
// 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;
vector<int> preorder(Node* root) {
dfs(root);
return res;
}
void dfs(Node *root){
if(!root)return;
res.push_back(root->val);
for(auto child:root->children)
dfs(child);
}
};
本文标题：589. N叉树的前序遍历
本文链接：https://www.haomeiwen.com/subject/vcnnqktx.html
网友评论