我正在编写一个dfs函数，它返回到叶节点的所有路径。

4
   / \
  9   0
 / \
1   5

此列表的预期输出为： [[4,9,5],[4,9,1],[4,0]] 这就是我到目前为止所做的：

class TreeNode:
   def __init__(self, val=0, left=None, right=None):
     self.val = val
     self.left = left
     self.right = right

    def leafNodePaths(self, root):
        paths = []
        self.dfs(root, [], paths)
        print(paths)

    def dfs(self, root, current_path, paths): 
        if not root: 
            return

        current_path.append(root.val)
        if not root.left and not root.right:
            paths.append(current_path)
        else:
            self.dfs(root.left, current_path, paths)
            self.dfs(root.right, current_path, paths)

我得到的结果是 [[4, 9, 5, 1, 0], [4, 9, 5, 1, 0], [4, 9, 5, 1, 0]] 我如何准确地计算 current_path