forked from prateekshyap/DSA
-
Notifications
You must be signed in to change notification settings - Fork 0
/
EvenOddTree.java
71 lines (69 loc) · 2.16 KB
/
EvenOddTree.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
/*https://leetcode.com/problems/even-odd-tree/*/
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public boolean isEvenOddTree(TreeNode root) {
Queue<TreeNode> queue = new LinkedList<TreeNode>();
int len, i, prev, curr;
TreeNode node;
boolean flag = true;
queue.add(root);
while (!queue.isEmpty())
{
len = queue.size();
if (len == 1)
{
node = queue.poll();
if (flag && node.val%2 == 0) return false;
else if (!flag && node.val%2 == 1) return false;
if (node.left != null) queue.add(node.left);
if (node.right != null) queue.add(node.right);
flag = !flag;
continue;
}
if (flag)
{
prev = Integer.MIN_VALUE;
for (i = 0; i < len; ++i)
{
node = queue.poll();
curr = node.val;
if (node.left != null) queue.add(node.left);
if (node.right != null) queue.add(node.right);
if (prev >= curr) return false;
if (curr%2 == 0) return false;
prev = curr;
}
}
else
{
prev = Integer.MAX_VALUE;
for (i = 0; i < len; ++i)
{
node = queue.poll();
curr = node.val;
if (node.left != null) queue.add(node.left);
if (node.right != null) queue.add(node.right);
if (prev <= curr) return false;
if (curr%2 == 1) return false;
prev = curr;
}
}
flag = !flag;
}
return true;
}
}