leetcode 590. N叉树的后序遍历

给定一个 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,List<Node> _children) {
        val = _val;
        children = _children;
    }
};
*/
class Solution {
    public List<Integer> postorder(Node root) {
        List<Integer> result = new ArrayList<>();
        if(root == null){
            return result;
        }
        Stack<Node> stack = new Stack<>();
        stack.push(root);
        Node pre = null;
        while(stack.size() > 0){
            root = stack.peek();
            if(root.children.size()==0||(pre != null&&root.children.contains(pre))){
                result.add(root.val);
                pre = stack.pop();
            }else{
                for(int i = root.children.size() - 1;i >= 0;i--){
                    stack.add(root.children.get(i));
                }
            }
        }
        return result;
    }
}

递归法

/*
// 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> list = new ArrayList<>();
    public List<Integer> postorder(Node root) {
        getResult(root);
        return list;
    }
    
    public void getResult(Node root){
        if(root == null){
            return;
        }
        for(int i = 0;i < root.children.size();i++){
            getResult(root.children.get(i));
        }
        list.add(root.val);
    }
}