二叉树路径和问题中的递归逻辑错误输出

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

def pathSum(root, targetSum):
    def dfs(node, currentSum, path):
        if not node:
            return []
        currentSum += node.val
        path.append(node.val)
        if not node.left and not node.right and currentSum == targetSum:
            return [path]
        return dfs(node.left, currentSum, path) + dfs(node.right, currentSum, path)
    
    return dfs(root, 0, [])

def pathSum(root, targetSum):
    def dfs(node, currentSum, path):
        if not node:
            return []
        currentSum += node.val
        new_path = path + [node.val]
        if not node.left and not node.right and currentSum == targetSum:
            return [new_path]
        left_paths = dfs(node.left, currentSum, new_path)
        right_paths = dfs(node.right, currentSum, new_path)
        return left_paths + right_paths
    
    return dfs(root, 0, [])