Time: 41 ms (15.76%) | Memory: 16.6 MB (20.02%) - LeetSync

Author: mrprashantkumar

145-binary-tree-postorder-traversal/binary-tree-postorder-traversal.py

@@ -0,0 +1,18 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def postorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
+        def helper(root):
+            if not root:
+                return 
+            nonlocal ans
+            helper(root.left)
+            helper(root.right)
+            ans.append(root.val)
+        ans = []
+        helper(root)
+        return ans