Find Paths in Binary Tree

Kevin has sketched a series of integers, forming a diagram that represents a binary tree. Challenged by a friend, Kevin needs to find all paths from the root to the leaf where the sum equals a given number 'K'. Due to other commitments, he requests your assistance in completing this task.

Example:

Input:

If the tree structure is:

For K = 15

Output:

Paths are [5, 6, 4] and [5, 15, -5]

Explanation:

The paths starting at the root and ending at a leaf that add up to 15 are identified.

Constraints:

• 1 <= T <= 10
• 1 <= N <= 10³
• -10⁵ <= K <= 10⁵
• -10⁵ <= DATA <= 10⁴

Time Limit:

1 second

Note:

You need to implement the provided function only as the other parts such as printing are already handled. Follow the input format carefully and make sure paths are in the correct format: enclosed in square brackets and separated by spaces in the output.