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>res;//值得注意的是res返回结果一定要放在外边否则res里面最多只有一个元素
    vector<int> postorder(Node* root) {
        
        if(root==NULL)
        {
            return res;
        }
        else if(root!=NULL)
        {
            for(Node* temp:root->children)
            {
                postorder(temp);
            }
            res.push_back(root->val);
        }
        return res;
    }
};