1
class Solution {
2
public:
3
bool checkTree(TreeNode *root) {
4
if (root->left->val + root->right->val == root->val) {
5
return true;
6
}
7
return false;
8
}
9
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0