-
Notifications
You must be signed in to change notification settings - Fork 0
/
1022.cpp
36 lines (30 loc) · 826 Bytes
/
1022.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
#include<iostream>
using namespace std;
// 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 dfs(TreeNode* root,int val){
if(root==nullptr){
return 0;
}
val=(val<<1)|(root->val);
if(root->left==nullptr and root->right==nullptr){
return val;
}
return dfs(root->left,val)+dfs(root->right,val);
}
int sumRootToLeaf(TreeNode* root) {
return dfs(root,0);
}
};
int main(){
return 0;
}