2022-09-30 update: added "Evaluate Boolean Binary Tree" (#117)

Author: fartem

README.md

@@ -398,6 +398,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 2315. Count Asterisks                                                    | [Link](https://leetcode.com/problems/count-asterisks/)                                                    | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/CountAsterisks.java)                                               |
 | 2319. Check if Matrix Is X-Matrix                                        | [Link](https://leetcode.com/problems/check-if-matrix-is-x-matrix/)                                        | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/CheckIfMatrixIsXMatrix.java)                                       |
 | 2325. Decode the Message                                                 | [Link](https://leetcode.com/problems/decode-the-message/)                                                 | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/DecodeTheMessage.java)                                             |
+| 2331. Evaluate Boolean Binary Tree                                       | [Link](https://leetcode.com/problems/evaluate-boolean-binary-tree/)                                       | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/EvaluateBooleanBinaryTree.java)                                    |
 | 2351. First Letter to Appear Twice                                       | [Link](https://leetcode.com/problems/first-letter-to-appear-twice/)                                       | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/FirstLetterToAppearTwice.java)                                     |
 | 2357. Make Array Zero by Subtracting Equal Amounts                       | [Link](https://leetcode.com/problems/make-array-zero-by-subtracting-equal-amounts/)                       | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/MakeArrayZeroBySubtractingEqualAmounts.java)                       |
 | 2367. Number of Arithmetic Triplets                                      | [Link](https://leetcode.com/problems/number-of-arithmetic-triplets/)                                      | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/NumberOfArithmeticTriplets.java)                                   |

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/EvaluateBooleanBinaryTree.java

@@ -0,0 +1,31 @@
+package com.smlnskgmail.jaman.leetcodejava.easy;
+
+import com.smlnskgmail.jaman.leetcodejava.support.TreeNode;
+
+// https://leetcode.com/problems/evaluate-boolean-binary-tree/
+public class EvaluateBooleanBinaryTree {
+
+    private final TreeNode input;
+
+    public EvaluateBooleanBinaryTree(TreeNode input) {
+        this.input = input;
+    }
+
+    public boolean solution() {
+        return evaluateTree(input);
+    }
+
+    private boolean evaluateTree(TreeNode root) {
+        switch (root.val) {
+            case 0:
+                return false;
+            case 1:
+                return true;
+            case 2:
+                return evaluateTree(root.left) || evaluateTree(root.right);
+            default:
+                return evaluateTree(root.left) && evaluateTree(root.right);
+        }
+    }
+
+}

src/test/java/com/smlnskgmail/jaman/leetcodejava/easy/EvaluateBooleanBinaryTreeTest.java

@@ -0,0 +1,27 @@
+package com.smlnskgmail.jaman.leetcodejava.easy;
+
+import com.smlnskgmail.jaman.leetcodejava.support.TreeNode;
+import org.junit.Test;
+
+import static org.junit.Assert.assertTrue;
+
+public class EvaluateBooleanBinaryTreeTest {
+
+    @Test
+    public void defaultTest() {
+        assertTrue(
+                new EvaluateBooleanBinaryTree(
+                        new TreeNode(
+                                2,
+                                new TreeNode(1),
+                                new TreeNode(
+                                        3,
+                                        new TreeNode(0),
+                                        new TreeNode(1)
+                                )
+                        )
+                ).solution()
+        );
+    }
+
+}