Runtime 52 ms (Top 66.12%) | Memory 16.0 MB (Top 80.3%)

Author: AnasImloul

scripts/algorithms/N/N-ary Tree Postorder Traversal/Nary Tree Postorder Traversal.py

@@ -0,0 +1,16 @@
+class Solution(object):
+	def postorder(self, root):
+		"""
+		:type root: Node
+		:rtype: List[int]
+		"""
+		res=[]
+		def bfs(root):
+			if root:
+				for child in root.children:
+					bfs(child)
+
+				res.append(root.val)
+		bfs(root)
+
+		return res