【树】leetcode_590_N 叉树的后序遍历

【树】leetcode_590_N 叉树的后序遍历

/*
// 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;
        first_get(root, result);
        return result;

        
    }
        void first_get(Node* cur, vector<int> &res) {
            if (cur == nullptr) return;
            
            for(int i =0 ; i<cur->children.size(); i++){
                first_get(cur->children[i],res); 
          }
          res.push_back(cur->val);
    }
};