路径总和 II

class TreeNode:
    def __init__(____):
        self.val = val
        self.left = left
        self.right = right

def solve():
    def pathSum(____):
        result = []
        def dfs(____):
            if not node:
                return
            path.append(____)
            total += node.val
            if not node.left and not node.right and total == targetSum:
                result.append(____)
            dfs(____)
            dfs(____)
            path.pop()
        dfs(____)
        return result
    root = TreeNode(____, TreeNode(____, TreeNode(____, TreeNode(____), TreeNode(____))), TreeNode(____, TreeNode(____), TreeNode(____, TreeNode(____), TreeNode(____))))
    print(pathSum(____))