Time: 33 ms (99.22%), Space: 18.1 MB (77.39%) - LeetHub

Author: Deepak5113

0590-n-ary-tree-postorder-traversal/0590-n-ary-tree-postorder-traversal.py

@@ -0,0 +1,25 @@
+"""
+# Definition for a Node.
+class Node:
+    def __init__(self, val=None, children=None):
+        self.val = val
+        self.children = children
+"""
+
+class Solution:
+    def postorder(self, root: 'Node') -> List[int]:
+        if not root:
+            return []
+        
+        stack = [root]
+        result = []
+        
+        while stack:
+            node = stack.pop()
+            result.append(node.val)
+            # Add all children to stack
+            for child in node.children:
+                stack.append(child)
+        
+        # Since we're effectively collecting the nodes in reverse order, reverse the result
+        return result[::-1]