Leetcode 113. Path Sum II

Problem

Given the root of a binary tree and an integer targetSum, return all root-to-leaf paths where each path’s sum equals targetSum.

A leaf is a node with no children.

Algorithm

Recursion. Divide the tree into two sub-trees and find sum-root-val in each one. Just save the path when the sum is right.

Code

# 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: TreeNode, targetSum: int) -> List[List[int]]:
        
        if not root:
            return []
        
        ans = []
        buf = [0] * 5000
        def test(root, sum_val, depth):
            if not root:
                if sum_val == 0:
                    ans.append(buf[0:depth])
            
            buf[depth] = root.val
            if not root.left and not root.right:
                if sum_val == root.val:
                    ans.append(buf[0:depth+1])
                    return
            
            if root.left:
                test(root.left, sum_val-root.val, depth+1)
            
            if root.right:
                test(root.right, sum_val-root.val, depth+1)
        
        test(root, targetSum, 0)
        
        return ans