力扣-590题 N叉树的后序遍历（C++）

淩亂°似流年 2022-09-02 11:35 126阅读 0赞

题目链接：[https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal/][https_leetcode-cn.com_problems_n-ary-tree-postorder-traversal]  
题目如下：  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQwNDY3Njcw_size_16_color_FFFFFF_t_70]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQwNDY3Njcw_size_16_color_FFFFFF_t_70 1]

/*
    // 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> result;
        vector<int> postorder(Node* root) {
        
            dfs(root);
            return result;
        }
        
        void dfs(Node* root){
        
            if(root==NULL) return ;
    
            for(auto e:root->children)
                dfs(e);
    
            result.push_back(root->val);
        }
    };

[https_leetcode-cn.com_problems_n-ary-tree-postorder-traversal]: https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal/
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQwNDY3Njcw_size_16_color_FFFFFF_t_70]: /images/20220829/d71aa5a06d2747b2995551ae10b58e6a.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQwNDY3Njcw_size_16_color_FFFFFF_t_70 1]: /images/20220829/c06416da00e04a3e8b66e58b7f98eba3.png