K - Sum Path In A Binary Tree

Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in each path equals 'K'.

Example:

Input:

tree = [1, 2, 3, 4, -1, 5, 6, -1, 7, -1, -1, -1, -1, -1, -1]
K = 4

Output:

[ [1, 3], [3, 1], [-1, 4, 1], [4], [-1, 5] ]

Explanation:

[1, 3], [3, 1], [-1, 4, 1], [4], and [-1, 5] are paths where the sum of values is 4.

Constraints:

1 ≤ T ≤ 50

1 ≤ N ≤ 10^2

-10^9 ≤ K ≤ 10^9

-10^7 ≤ DATA ≤ 10^7

Note:

The path can start and end anywhere, but it must move downwards (from parent to child). Implement the function and return paths in order; you don't need to print.

Question

K - Sum Path In A Binary Tree

Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in each path equals 'K'.

Example:

Input:

tree = [1, 2, 3, 4, -1, 5, 6, -1, 7, -1, -1, -1, -1, -1, -1]
K = 4

Output:

[ [1, 3], [3, 1], [-1, 4, 1], [4], [-1, 5] ]

Explanation:

[1, 3], [3, 1], [-1, 4, 1], [4], and [-1, 5] are paths where the sum of values is 4.

Constraints:

1 ≤ T ≤ 50
1 ≤ N ≤ 10^2
-10^9 ≤ K ≤ 10^9
-10^7 ≤ DATA ≤ 10^7

Note:

The path can start and end anywhere, but it must move downwards (from parent to child). Implement the function and return paths in order; you don't need to print.

Accepted Answer

Find all paths in a binary tree with nodes summing up to a given value K.

Traverse the binary tree and keep track of the current path and its sum.
At each node, check if the sum equals K and store the path if true.
Recursively explore left and right subtrees while updating the path and sum.
Return the list of paths that sum up to K in the binary tree.