forked from dhyey6602/leetcode_september
-
Notifications
You must be signed in to change notification settings - Fork 0
/
8-september.txt
38 lines (35 loc) · 892 Bytes
/
8-september.txt
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
/**
* 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:
int ans = 0;
int sumRootToLeaf(TreeNode* root) {
totsum(root, 0);
return ans;
}
void totsum(TreeNode* root, int temp)
{
if(root == NULL)
return;
temp = temp | root->val;
if((root->left == NULL) && (root->right == NULL))
{
ans += temp;
}
else
{
temp = temp<<1;
totsum(root->left, temp);
totsum(root->right, temp);
}
}
};