Leetcode-Submissions/Path-Sum.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
/**
 * 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 == NULL){
            return false;
        }
        targetSum -= root->val;
        if(root->left == NULL && root->right == NULL && targetSum == 0){
            return true;
        }
        bool leftSum = hasPathSum(root->left , targetSum);
        bool rightSum = hasPathSum(root->right , targetSum);
        return (leftSum || rightSum);
    }
};