-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPath_Sum.cpp
31 lines (25 loc) · 990 Bytes
/
Path_Sum.cpp
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
PROBLEM STATEMENT :- Given the root of a binary tree and an integer targetSum, return true if the tree has a root-to-leaf path such that adding up all the values along
the path equals targetSum. A leaf is a node with no children.
SOLUTION :-
/**
* 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;
if(root->val == targetSum && root->left==NULL && root->right==NULL)
return true;
return hasPathSum(root->left , targetSum-root->val) || hasPathSum(root->right, targetSum-root->val);
}
};