590. N叉树的后序遍历(迭代、递归)2

给定一个 N 叉树，返回其节点值的后序遍历。

例如，给定一个 3叉树 :

返回其后序遍历: [5,6,3,2,4,1].

说明: 递归法很简单，你可以使用迭代法完成此题吗?

法一：迭代

/*
// 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) {
        LinkedList<Integer> list = new LinkedList<Integer>();
        if (root == null) return list;
        Stack<Node> stack = new Stack<Node>();

        stack.push(root);
        while (!stack.isEmpty()) {
            Node node = stack.pop();
            List<Node> child = node.children;
            list.addFirst(node.val);
            for (Node no : child) {
                stack.push(no);
            }
        }
        return list;
    }
}

法一：递归

/*
// 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<>();
        if (root == null)
            return list;
        
        for(Node node: root.children)
            postorder(node);
        
        list.add(root.val);
        
        return list;
    }
}