590. N-ary Tree Postorder Traversal

590. N-ary Tree Postorder Traversal

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

    public Node() {}

    public Node(int _val) {
        val = _val;
    }

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

class Solution {
    public List<Integer> postorder(Node root) {
        List<Integer>list=new ArrayList<>();
        helper(root,list);
        return list;
    }
    public List<Integer> helper(Node root,List<Integer>list){
        if(root==null){
            return null;
        }
        if(root.children==null){
            return list;
        }
        for(Node node:root.children){
            helper(node,list);
        }
        list.add(root.val);
        return list;
    }
}