【leetcode】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,List<Node> _children) {
        val = _val;
        children = _children;
    }
};
*/
class Solution {
    List<Integer> result = new ArrayList();
    public List<Integer> postorder(Node root) {
        if (root == null)
            return result;
        if(root.children!=null) {
            for (Iterator iter=root.children.iterator(); iter.hasNext(); ) {
                postorder((Node) iter.next());
            }
        }
        result.add(root.val);
        return result;
    }
}