Time: 59 ms (5.20%), Space: 16.3 MB (89.16%) - LeetHub

Author: mardavsj

0257-binary-tree-paths/0257-binary-tree-paths.py

@@ -0,0 +1,14 @@
+class Solution:
+    def binaryTreePaths(self, root: Optional[TreeNode]) -> List[str]:
+        ans = []
+        def solve(root, s):
+            s += str(root.val)
+            if not root.right and not root.left:
+                ans.append(s)
+                return
+            if root.right:
+                solve(root.right, s+"->")
+            if root.left:
+                solve(root.left, s+"->")
+        solve(root, "")
+        return ans