Leetcode590N-ary Tree Postorder TraversalN叉树的后序遍历

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/iov3Rain/article/details/83589729

给定一个 N 叉树，返回其节点值的后序遍历。

class Node {
public:
    int val;
    vector<Node*> children;

    Node() {}

    Node(int _val, vector<Node*> _children) {
        val = _val;
        children = _children;
    }
};

class Solution {
public:
    vector<int> res;
    vector<int> postorder(Node* root)
    {
        if(root == NULL)
            return res;
        Fun(root);
        return res;
    }

    void Fun(Node* root)
    {
        if(root == NULL)
            return;
        int len = root ->children.size();
        for(int i = 0; i < len; i++)
        {
            if(root ->children[i] != NULL)
                Fun(root ->children[i]);
        }
        res.push_back(root ->val);
    }
};