# 2331.计算布尔二叉树的值

## 问题描述
[2331.计算布尔二叉树的值](https://leetcode.cn/problems/evaluate-boolean-binary-tree/)

## 解题思路
递归

## 代码
```cpp
class Solution {
public:
    bool dfs(TreeNode *root) {
        if (root->left == nullptr) {
            return root->val;
        }
        if (root-> val == 2) {
            return dfs(root->left) || dfs(root->right);
        } else {
            return dfs(root->left) && dfs(root->right);
        }
    }
    bool evaluateTree(TreeNode* root) {
        return dfs(root);
    }
};
```