590. N-ary Tree Postorder Traversal

https://leetcode.com/problems/n-ary-tree-postorder-traversal/

1. Use recursion:

//36 ms    11.2 MB
// 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> postorder(Node* root) {
        vector<int> result;
        postorder(root, result);
        return result;
    }
private:
    void postorder(Node* root, vector<int>& result) {
        if(!root) return;
        for(auto child: root->children)
            postorder(child, result);
        result.push_back(root->val);
    }
};