cpp-programs/112. Path Sum at main · gauravgupta654/cpp-programs · 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
/**
 * 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 hasPathSum(TreeNode* root, int targetSum) {
        if(!root){
            return false;
        }
        if(!root->left && !root->right){
            return targetSum == root->val;
        }
        bool leftPath = hasPathSum(root->left , targetSum-root->val);
        bool rightPath = hasPathSum(root->right,targetSum-root->val);
        return  leftPath || rightPath;
    }
};