Path Sum In Binary Tree - Ii
medium
1. You are given a partially written function to solve. 2. You are required to complete the body of PathSum function. The function is expected to return all root-to-leaf paths where each path's sum equals targetSum. 3. Input and Output is managed for you.
Constraints
0 <= Number of Nodes <= 10^9 -10^9 <= value of Node data <= 10^9
Format
Input
Input is managed for you.
Output
Output is managed for you.
Example
Sample Input
7
1
2
-1
-1
3
-1
-1
4
Sample Output
1 3