Create n-ary-tree-postorder-traversal.py

Author: kamyu104

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

@@ -0,0 +1,49 @@
+# Time:  O(n)
+# Space: O(h)
+
+# Given an n-ary tree, return the postorder traversal of its nodes' values.
+# For example, given a 3-ary tree:
+# Return its postorder traversal as: [5,6,3,2,4,1].
+# Note: Recursive solution is trivial, could you do it iteratively?
+    
+# Definition for a Node.
+class Node(object):
+    def __init__(self, val, children):
+        self.val = val
+        self.children = children
+
+
+class Solution(object):
+    def postorder(self, root):
+        """
+        :type root: Node
+        :rtype: List[int]
+        """
+        if not root:
+            return []
+        result, stack = [], [root]
+        while stack:
+            node = stack.pop()
+            result.append(node.val)
+            for child in node.children:
+                if child:
+                    stack.append(child)
+        return result[::-1]
+
+
+class Solution2(object):
+    def postorder(self, root):
+        """
+        :type root: Node
+        :rtype: List[int]
+        """
+        def dfs(root, result):
+            for child in root.children:
+                if child:
+                    dfs(child, result)
+            result.append(root.val)
+        
+        result = []
+        if root:
+            dfs(root, result)
+        return result