590. N-ary Tree Postorder Traversal

發表於 | 分類於

problem

solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
/*
// 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:
    void postorder(Node *root, vector<int> & ret){
        if(!root) return;
        
        
        for(Node *p : root->children){
            postorder(p, ret);
        }
        ret.push_back(root->val);
    }
    vector<int> postorder(Node* root) {
        vector<int> ret;
        postorder(root, ret);
        return ret;
        
    }
};