leetcode

0 class Solution {

1 public:

2 bool evaluateTree(TreeNode *root) {

3 switch (root->val) {

4 case 0:

5 case 1: return root->val;

6 case 2: return evaluateTree(root->left) || evaluateTree(root->right);

7 case 3: return evaluateTree(root->left) && evaluateTree(root->right);

8 default: return false;

9 }

10 }

11 };