Leetcode-Submissions/Path-Sum-II.cpp at main · Shrijeet14/Leetcode-Submissions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:


    void solve(TreeNode* root,int targetSum,vector<vector<int>> &finalAns,vector<int> temp,int sum){
        //base case
        if(root == NULL){
            return;
        }
        sum += root->val;
        temp.push_back(root->val);

        if(root->left == NULL && root->right == NULL){
            if(sum == targetSum){
                finalAns.push_back(temp);
            }
            else{
                return;
            }
        }
        solve(root->left,targetSum,finalAns,temp,sum);
        solve(root->right,targetSum,finalAns,temp,sum);
    }
    vector<vector<int>> pathSum(TreeNode* root, int targetSum){
        vector<vector<int>> finalAns;
        vector<int> temp;
        int sum = 0;
        solve(root,targetSum,finalAns,temp,sum);
        return finalAns;
    }
};