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

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:
+    def traversal(self, cur: TreeNode, path: List[int], result: List[str]) -> None:
-        if not node:
+        if not cur:
             return
-        path.append(node.val)
+        path.append(cur.val)
-        if not node.left and not node.right:
+        if not cur.left and not cur.right:
             result.append('->'.join(map(str, path)))
-        else:
+        if cur.left:
-	     # path[:] 是隐藏回溯
+            self.traversal(cur.left, path[:], result)
-            self.generate_paths(node.left, path[:], result)
+        if cur.right:
-            self.generate_paths(node.right, path[:], result)
+            self.traversal(cur.right, path[:], result)
 
 ```