Description Link to heading
2331.evaluate-boolean-binary-tree
Solution Link to heading
dfs(recursion)
Code Link to heading
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);
}
};