Leetcode/Path Sum.cpp at main · isha-24/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
//https://leetcode.com/problems/path-sum/

/**
 * 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 helper(TreeNode* root, int ts, int sum){
        if(!root) return false;
        if(!root->left && !root->right) return (ts==sum+root->val);
        bool l=helper(root->left, ts, sum+root->val);
        bool r=helper(root->right, ts, sum+root->val);
        return l||r;
    }
    bool hasPathSum(TreeNode* root, int ts) {
        return helper(root, ts, 0);
    }
};