LeetCode 590. N叉树的后序遍历

基本思路

建立两个Stack，一个用于把每层放入，再每层弹出给下一个stack和把root交给子节点。下一个stack用于把值传递给list。

/*
// 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> list = new ArrayList<Integer>();
        
        if(root == null) return list;
        if(root.children == null){
            list.add(root.val);
            return list;
        }
        
        Stack<Node> stack = new Stack<Node>();
        Stack<Node> restack = new Stack<Node>();
        stack.push(root);
        while(!stack.isEmpty()){
            root = stack.pop();
            restack.push(root);
            for(int i=0; i<root.children.size(); i++){
                stack.push(root.children.get(i));
            }
        }
        
        while(!restack.isEmpty()){
            list.add(restack.pop().val);
        }
        return list;
    }
}

改进

递归思想，遍历root.children并作为node递归。

class Solution {
    List<Integer> list = new ArrayList();

    public List<Integer> postorder(Node root) {
        if (root != null) {
            for (Node node : root.children) {
                postorder(node);
            }
            list.add(root.val);
        }
        return list;
    }
}