DSA/C++/LeetCode/0112.cpp at main · spycedcoffee/DSA · 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
/**
 * 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:
    bool is_path(TreeNode* root, int targetSum, int curr_sum){

        if(!root)
            return false;

        curr_sum += root -> val;

        if(!root -> left && !root -> right){

            if(curr_sum == targetSum)
                return true;

            else
                return false;
        }

        return (is_path(root -> left, targetSum, curr_sum) || is_path(root -> right, targetSum, curr_sum));
    }

    bool hasPathSum(TreeNode* root, int targetSum) {
        return is_path(root, targetSum, 0);
    }
};