Evaluate Boolean Binary Tree LeetCode solution in Java

1
class Solution {
2
  public boolean evaluateTree(TreeNode root) {
3
    if (root.val == 1) return true;
4
    if (root.val == 0) return false;
5
    if (root.val == 2) return evaluateTree(root.left) || evaluateTree(root.right);
6
    return evaluateTree(root.left) && evaluateTree(root.right);
7
  }
8
}