eveluate_bollean_binary_tree.cpp

class Solution {
public:
 
    bool evaluateTree(TreeNode* root) {
       if(root->val==2)
           return evaluateTree(root->left) || evaluateTree(root->right) ;
           if(root->val==3)
           return evaluateTree(root->left) && evaluateTree(root->right);
          else  
          return root->val; 
       
    }
  

    
};
/* 
eveluate bollean binary tree
class Solution {
public:
    bool evaluateTree(TreeNode* root) {
        if( root->val == 1)return true;
        if( root->val ==0)return false;
        if (root->val ==2)return evaluateTree(root->left) or evaluateTree(root->right);
        if(root->val ==3)return evaluateTree(root->left) and evaluateTree (root->right);

        return true;

        
    }
};

methods 2
class Solution {
public:
    bool evaluateTree(TreeNode* root) {
        // base case: leaf
        if (root->val < 2) return root->val;
        // or node
        else if (root->val == 2) return evaluateTree(root->left) || evaluateTree(root->right);
        // and node
        return evaluateTree(root->left) && evaluateTree(root->right);
    }
};