-
Notifications
You must be signed in to change notification settings - Fork 6
/
112.PathSum.cpp
44 lines (38 loc) · 1.11 KB
/
112.PathSum.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
32
33
34
35
36
37
38
39
40
41
42
43
44
#include<bits/stdc++.h>
using namespace std;
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:
void traversal (TreeNode* root, int targetSum, int sum, bool &flag) {
// return if flag is true or root is null
if (root == nullptr || flag) {
return;
}
// add the value of nodes
sum += root->val;
// if its leaf node and sum is equals target then true flag and return
if(root->left == nullptr && root->right == nullptr && targetSum == sum) {
flag = true;
return;
}
// traversal to left
traversal (root->left,targetSum, sum, flag);
// traversal to right
traversal (root->right,targetSum, sum, flag);
}
bool hasPathSum(TreeNode* root, int &targetSum) {
// reference variable to store the result
bool flag = false;
// call the traversal function
traversal (root, targetSum, 0, flag);
// return the result
return flag;
}
};