Java Easy Solution -100% faster 0ms
upvote is appreciated\n\nclass Solution {\n    List<Integer> l1=new ArrayList();\n    public List<Integer> postorder(Node root) {\n        if(root==null)\n     
##### upvote is appreciated\n```\nclass Solution {\n    List<Integer> l1=new ArrayList();\n    public List<Integer> postorder(Node root) {\n        if(root==null)\n            return l1;\n        for(Node n: root.children)  \n            postorder(n);\n        l1.add(root.val);\n        return l1;\n    }\n}\n```
['Recursion', 'Java']