Evaluate Boolean Binary Tree LeetCode solution in C++

1
class Solution {
2
public:
3
bool evaluateTree(TreeNode *root) {
4
return (root->val < 2) ? root->val
5
: (root->val == 2) ? evaluateTree(root->left) || evaluateTree(root->right)
6
: evaluateTree(root->left) && evaluateTree(root->right);
7
}
8
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0