力扣 129.二叉树中的深搜_求根节点到叶节点数字之和_C++
class Solution {
public:
bool evaluateTree(TreeNode* root) {
if(!root->left|| !root->right) return root->val;
bool l=evaluateTree(root->left);
bool r=evaluateTree(root->right);
if(root->val==2) return l|r;
return l&r;
}
};