_113. Path Sum II.md

113. Path Sum II

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : July 03, 2024

Last updated : July 03, 2024

---

Related Topics : Backtracking, Tree, Depth-First Search, Binary Tree

Acceptance Rate : 59.34 %

---

Solutions

• m113.py

Python

m113.py

# 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]]:
        if not root :
            return []
        output = []

        def helper(curr: Optional[TreeNode], currSum: int, path: List[int]) -> None :
            if not curr :
                return

            currSum += curr.val
            path.append(curr.val)

            if currSum == targetSum and not curr.left and not curr.right :
                output.append(path.copy())
            
            if curr.left :
                helper(curr.left, currSum, path)
            if curr.right :
                helper(curr.right, currSum, path)

            path.pop()
        helper(root, 0, [])

        return output