| # | 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||

packagecom.fishercoder.solutions;

importcom.fishercoder.common.classes.TreeNode;

publicclass_2331 {

publicstaticclassSolution1 {

publicbooleanevaluateTree(TreeNoderoot) {

if (root ==null) {

returntrue;

}

if (root.left ==null &&root.right ==null) {

if (root.val ==0) {

returnfalse;

}else {

returntrue;

}

}

if (root.val ==2) {

returnevaluateTree(root.left) ||evaluateTree(root.right);

}else {

returnevaluateTree(root.left) &&evaluateTree(root.right);

}

}

}

}