We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 4549578 commit ed8ec0fCopy full SHA for ed8ec0f
2331. Evaluate Boolean Binary Tree
@@ -0,0 +1,10 @@
1
+class Solution {
2
+public:
3
+ bool evaluateTree(TreeNode* root) {
4
+ if (root->val == 1) return true;
5
+ else if (root->val==0) return false;
6
+ else if (root->val==2) return evaluateTree(root->left) || evaluateTree(root->right);
7
+ else if (root->val==3) return evaluateTree(root->left) && evaluateTree(root->right);
8
+ return false;
9
+ }
10
+};
0 commit comments