LeetCode 590. N 叉树的后序遍历
原题链接
简单
作者:
我是java同学
,
2024-02-19 07:18:37
,
所有人可见
,
阅读 27
/*
// 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> ans;
vector<int> postorder(Node* root) {
function<void(Node*)> dfs = [&](Node* root) {
if (!root) return;
for (auto child: root->children)
dfs(child);
ans.push_back(root->val);
};
dfs(root);
return ans;
}
};