//url:https://leetcode.com/problems/n-ary-tree-postorder-traversal/description/
/*
// Definition for a Node.
class Node {
public:
int val;
vector children;
Node() {}
Node(int \_val, vector \_children) {
val = \_val;
children = \_children;
}
};
*/
class Solution {
public:
vector postorder(Node* root) {
postorderEx(root);
return _res;
}
void postorderEx(Node* root){
if(!root)
return;
//std::cout<<” v=”<val<children.size();i++){
postorderEx(root->children[i]);
}
_res.push_back(root->val);
}
vector \_res;
};
- 本文作者: royalchen
- 本文链接: http://www.royalchen.com/2018/08/06/leetcode-590-n-ary-tree-postorder-traversal/
- 版权声明: 本博客所有文章除特别声明外,均采用 MIT 许可协议。转载请注明出处!