add 2331

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty                       | Tag                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|-------------
+| 2331 |[Evaluate Boolean Binary Tree](https://leetcode.com/problems/evaluate-boolean-binary-tree/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2331.java)                                                                      || Easy                                                                             ||
 | 2326 |[Spiral Matrix IV](https://leetcode.com/problems/spiral-matrix-iv/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2326.java)                                                                     || Medium                                                                        ||
 | 2325 |[Decode the Message](https://leetcode.com/problems/decode-the-message/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2325.java)                                                                     || Easy                                                                          ||
 | 2319 |[Check if Matrix Is X-Matrix](https://leetcode.com/problems/check-if-matrix-is-x-matrix/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2319.java)                                                                     || Easy                                                                          ||

src/main/java/com/fishercoder/solutions/_2331.java

@@ -0,0 +1,25 @@
+package com.fishercoder.solutions;
+
+import com.fishercoder.common.classes.TreeNode;
+
+public class _2331 {
+    public static class Solution1 {
+        public boolean evaluateTree(TreeNode root) {
+            if (root == null) {
+                return true;
+            }
+            if (root.left == null && root.right == null) {
+                if (root.val == 0) {
+                    return false;
+                } else {
+                    return true;
+                }
+            }
+            if (root.val == 2) {
+                return evaluateTree(root.left) || evaluateTree(root.right);
+            } else {
+                return evaluateTree(root.left) && evaluateTree(root.right);
+            }
+        }
+    }
+}