Leetcode/leetcode113.cpp at main · ksaini-web/Leetcode · 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
43
/**
 * 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 target,vector<vector<int>>& ans, vector<int> path){

    if(root==NULL) return ;

    path.push_back(root->val);


    if(root->left == NULL && root->right == NULL && target == root->val){
        ans.push_back(path);
    }

    solve(root->left,target-root->val,ans,path);
     solve(root->right,target-root->val,ans,path);

     path.pop_back();


}
    vector<vector<int>> pathSum(TreeNode* root, int targetSum) {

        vector<vector<int>>ans;
        vector<int>path;

        solve(root,targetSum,ans,path);

        return ans;

    }
};