590. N 叉树的后序遍历
AC Code
递归版
class Solution {
public:
vector<int> res;
void dfs(Node* root){
if(!root) return;
for(Node* item : root->children){
dfs(item);
}
res.emplace_back(root->val);
}
vector<int> postorder(Node* root) {
dfs(root);
return res;
}
};