力扣--＞#剑指Offer 590 . N元树后序遍历(E)

 先通过for循环递归完，递归以后再加入到list

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