Leet Code Daily 2024-05-16 - Evaludate Boolean Binary Tree

/**
 * 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:
    bool evaluateTree(TreeNode* root) {
        if (root->left == nullptr && root->right == nullptr) {
            return root->val == 1;
        }
        const bool lval = evaluateTree(root->left);
        const bool rval = evaluateTree(root->right);
        return (root->val == 2) ? (lval || rval) : (lval && rval);
    }
};