From debaa5e4a0cb16a58f226e04b0865ce1b423f122 Mon Sep 17 00:00:00 2001
From: jianghongcheng <35664721+jianghongcheng@users.noreply.github.com>
Date: Thu, 4 May 2023 22:54:49 -0500
Subject: [PATCH] =?UTF-8?q?Update=200257.=E4=BA=8C=E5=8F=89=E6=A0=91?=
 =?UTF-8?q?=E7=9A=84=E6=89=80=E6=9C=89=E8=B7=AF=E5=BE=84.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0257.二叉树的所有路径.md | 65 +++++++++++++++++++++++
 1 file changed, 65 insertions(+)

diff --git a/problems/0257.二叉树的所有路径.md b/problems/0257.二叉树的所有路径.md
index 8c542cea..c396f4a0 100644
--- a/problems/0257.二叉树的所有路径.md
+++ b/problems/0257.二叉树的所有路径.md
@@ -468,6 +468,71 @@ class Solution {
 ```
 ---
 ## Python:  
+	
+	
+递归法+回溯（版本一）
+```Python
+# 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
+import copy
+from typing import List, Optional
+
+class Solution:
+    def binaryTreePaths(self, root: Optional[TreeNode]) -> List[str]:
+        if not root:
+            return []
+        result = []
+        self.generate_paths(root, [], result)
+        return result
+    
+    def generate_paths(self, node: TreeNode, path: List[int], result: List[str]) -> None:
+        path.append(node.val)
+        if not node.left and not node.right:
+            result.append('->'.join(map(str, path)))
+        if node.left:
+            self.generate_paths(node.left, copy.copy(path), result)
+        if node.right:
+            self.generate_paths(node.right, copy.copy(path), result)
+        path.pop()
+
+
+```
+递归法+回溯（版本二）
+```Python
+# 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
+import copy
+from typing import List, Optional
+
+class Solution:
+    def binaryTreePaths(self, root: Optional[TreeNode]) -> List[str]:
+        if not root:
+            return []
+        result = []
+        self.generate_paths(root, [], result)
+        return result
+    
+    def generate_paths(self, node: TreeNode, path: List[int], result: List[str]) -> None:
+        if not node:
+            return
+        path.append(node.val)
+        if not node.left and not node.right:
+            result.append('->'.join(map(str, path)))
+        else:
+            self.generate_paths(node.left, copy.copy(path), result)
+            self.generate_paths(node.right, copy.copy(path), result)
+        path.pop()
+
+```
+	
 递归法+隐形回溯
 ```Python
 # Definition for a binary tree node.