add 1609

fishercoder1534 · fishercoder1534 · commit 4069c14fc58a · 2020-10-04T06:58:55.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1609|[Even Odd Tree](https://leetcode.com/problems/even-odd-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1609.java) ||Medium|Tree|
 |1608|[Special Array With X Elements Greater Than or Equal X](https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1608.java) ||Easy|Array|
 |1604|[Alert Using Same Key-Card Three or More Times in a One Hour Period](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1604.java) ||Medium|String, Ordered Map|
 |1603|[Design Parking System](https://leetcode.com/problems/design-parking-system/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1603.java) ||Easy|Design|
diff --git a/src/main/java/com/fishercoder/solutions/_1609.java b/src/main/java/com/fishercoder/solutions/_1609.java
@@ -0,0 +1,53 @@
+package com.fishercoder.solutions;
+
+import com.fishercoder.common.classes.TreeNode;
+
+import java.util.ArrayList;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.Queue;
+
+public class _1609 {
+    public static class Solution1 {
+        public boolean isEvenOddTree(TreeNode root) {
+            Queue<TreeNode> queue = new LinkedList<>();
+            queue.offer(root);
+            int level = 0;
+            while (!queue.isEmpty()) {
+                int size = queue.size();
+                List<Integer> list = new ArrayList<>();
+                for (int i = 0; i < size; i++) {
+                    TreeNode node = queue.poll();
+                    list.add(node.val);
+                    if (node.left != null) {
+                        queue.add(node.left);
+                    }
+                    if (node.right != null) {
+                        queue.add(node.right);
+                    }
+                }
+                if (level % 2 == 0) {
+                    for (int i = 0; i < list.size(); i++) {
+                        if (list.get(i) % 2 == 0) {
+                            return false;
+                        }
+                        if (i < list.size() - 1 && list.get(i) >= list.get(i + 1)) {
+                            return false;
+                        }
+                    }
+                } else {
+                    for (int i = 0; i < list.size(); i++) {
+                        if (list.get(i) % 2 != 0) {
+                            return false;
+                        }
+                        if (i < list.size() - 1 && list.get(i) <= list.get(i + 1)) {
+                            return false;
+                        }
+                    }
+                }
+                level++;
+            }
+            return true;
+        }
+    }
+}
