Update 0257.二叉树的所有路径.md

problems/0257.二叉树的所有路径.md

@@ -324,8 +324,31 @@ class Solution {
 ```
 
 Python：
+```Python
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def binaryTreePaths(self, root: TreeNode) -> List[str]:
+        path=[]
+        res=[]
+        def backtrace(root, path):
+            if not root:return 
+            path.append(root.val)
+            if (not root.left)and (not root.right):
+               res.append(path[:])
+            ways=[]
+            if root.left:ways.append(root.left)
+            if root.right:ways.append(root.right)
+            for way in ways:
+                backtrace(way,path)
+                path.pop()
+        backtrace(root,path)
+        return ["->".join(list(map(str,i))) for i in res]
 
-
+```
 Go：
 
 
@@ -335,4 +358,4 @@ Go：
 * 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)
 * B站视频：[代码随想录](https://space.bilibili.com/525438321)
 * 知识星球：[代码随想录](https://mp.weixin.qq.com/s/QVF6upVMSbgvZy8lHZS3CQ)
-<div align="center"><img src=../pics/公众号.png width=450 alt=> </img></div>
+<div align="center"><img src=../pics/公众号.png width=450 alt=> </img></div>