From 1a672740e99c000e44e1c5186bc57184b1f35b58 Mon Sep 17 00:00:00 2001
From: jianghongcheng <35664721+jianghongcheng@users.noreply.github.com>
Date: Mon, 22 May 2023 17:14:09 -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 | 18 +++++++++---------
 1 file changed, 9 insertions(+), 9 deletions(-)

diff --git a/problems/0257.二叉树的所有路径.md b/problems/0257.二叉树的所有路径.md
index 195b6f94..31cbdb56 100644
--- a/problems/0257.二叉树的所有路径.md
+++ b/problems/0257.二叉树的所有路径.md
@@ -512,19 +512,19 @@ class Solution:
         if not root:
             return []
         result = []
-        self.generate_paths(root, [], result)
+        self.traversal(root, [], result)
         return result
     
-    def generate_paths(self, node: TreeNode, path: List[int], result: List[str]) -> None:
-        if not node:
+    def traversal(self, cur: TreeNode, path: List[int], result: List[str]) -> None:
+        if not cur:
             return
-        path.append(node.val)
-        if not node.left and not node.right:
+        path.append(cur.val)
+        if not cur.left and not cur.right:
             result.append('->'.join(map(str, path)))
-        else:
-	     # path[:] 是隐藏回溯
-            self.generate_paths(node.left, path[:], result)
-            self.generate_paths(node.right, path[:], result)
+        if cur.left:
+            self.traversal(cur.left, path[:], result)
+        if cur.right:
+            self.traversal(cur.right, path[:], result)
 
 ```