LC 0113 [M] Path Sum II - ALawliet/algorithms GitHub Wiki

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def pathSum(self, root: Optional[TreeNode], targetSum: int) -> List[List[int]]:
        def dfs(node, path, pathsum):
            if not node.left and not node.right:
                if pathsum + node.val == targetSum:
                    self.global_ans.append(path + [node.val])
                    
            if node.left:
                dfs(node.left, path + [node.val], pathsum + node.val)
            
            if node.right:
                dfs(node.right, path + [node.val], pathsum + node.val)
                
        if not root: return []
        self.global_ans = []
        dfs(root, [], 0)
        return self.global_ans