_1609.java

packagecom.fishercoder.solutions.secondthousand;

importcom.fishercoder.common.classes.TreeNode;
importjava.util.ArrayList;
importjava.util.LinkedList;
importjava.util.List;
importjava.util.Queue;

publicclass_1609 {
publicstaticclassSolution1 {
publicbooleanisEvenOddTree(TreeNoderoot) {
Queue<TreeNode> queue = newLinkedList<>();
queue.offer(root);
intlevel = 0;
while (!queue.isEmpty()) {
intsize = queue.size();
List<Integer> list = newArrayList<>();
for (inti = 0; i < size; i++) {
TreeNodenode = 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 (inti = 0; i < list.size(); i++) {
if (list.get(i) % 2 == 0) {
returnfalse;
 }
if (i < list.size() - 1 && list.get(i) >= list.get(i + 1)) {
returnfalse;
 }
 }
 } else {
for (inti = 0; i < list.size(); i++) {
if (list.get(i) % 2 != 0) {
returnfalse;
 }
if (i < list.size() - 1 && list.get(i) <= list.get(i + 1)) {
returnfalse;
 }
 }
 }
level++;
 }
returntrue;
 }
 }
}