【leetcode刷题】T152-N叉树的后序遍历

"""
# Definition for a Node.
class Node(object):
    def __init__(self, val, children):
        self.val = val
        self.children = children
"""
class Solution(object):
    def postorder(self, root):
        """
        :type root: Node
        :rtype: List[int]
        """
        if not root:
            return []
        res = []
        self.helper(root, res)
        return res

    def helper(self, node, res):
        for child in node.children:
            self.helper(child, res)
        res.append(node.val)

/*
// Definition for a Node.
class Node {
public:
    int val;
    vector<Node*> children;

    Node() {}

    Node(int _val, vector<Node*> _children) {
        val = _val;
        children = _children;
    }
};
*/
class Solution {
public:
    vector<int> postorder(Node* root) {
        vector<int> res;
        if(!root)
            return res;
        helper(root, res);
        return res;
    }

    void helper(Node* node, vector<int>& res){
        for(auto child: node->children)
            helper(child, res);
        res.push_back(node->val);
    }
};