LeetCode 590 N叉树的后序遍历[dfs 树] HERODING的LeetCode之路

Posted 2022-03-14 HERODING23

解题思路：
标准的后序遍历模板即可，代码如下：

/*
// 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 
private:
    vector<int> ans;
public:
    vector<int> postorder(Node* root) 
        dfs(root);
        return ans;
    

    void dfs(Node* node) 
        if(node == nullptr) return;
        for(int i = 0; i < node->children.size(); i ++) 
            dfs(node->children[i]);
        
        ans.push_back(node->val);
    
;