N-ary Tree Postorder Traversal | Java Solution
\nclass Solution \n{\n    public List<Integer> postorder(Node root) \n    {\n        Stack<Node> stk = new Stack<>();\n        LinkedList<Integer> ans = new Lin
```\nclass Solution \n{\n    public List<Integer> postorder(Node root) \n    {\n        Stack<Node> stk = new Stack<>();\n        LinkedList<Integer> ans = new LinkedList<>();\n        if(root == null)\n            return ans;\n        stk.push(root);\n        while(!stk.isEmpty())\n        {\n            Node cur = stk.pop();\n            ans.addFirst(cur.val);\n            for(int i=0;i<cur.children.size();i++)\n                stk.push(cur.children.get(i));\n        }\n        return ans;\n    }\n}\n```
['Stack', 'Java']