/
1609. Even Odd Tree.cpp
82 lines (63 loc) · 1.89 KB
/
1609. Even Odd Tree.cpp
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
72
73
74
75
76
77
78
79
80
81
82
// https://leetcode.com/problems/even-odd-tree/
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution
{
public:
bool isEvenOddTree(TreeNode *root)
{
if (root == nullptr)
return true;
return BFS(root);
}
bool BFS(TreeNode *root)
{
queue<TreeNode *> nodes;
nodes.push(root);
int level = true;
while (!nodes.empty())
{
int size = nodes.size();
int max = INT_MAX;
int min = INT_MIN;
for (int i = 0; i < size; i++)
{
if (level)
{
TreeNode *current = nodes.front();
nodes.pop();
if (current->val % 2 == 0 || current->val <= min)
return false;
min = current->val;
if (current->left)
nodes.push(current->left);
if (current->right)
nodes.push(current->right);
}
else
{
TreeNode *current = nodes.front();
nodes.pop();
if (current->val % 2 == 1 || current->val >= max)
return false;
max = current->val;
if (current->left)
nodes.push(current->left);
if (current->right)
nodes.push(current->right);
}
}
level ^= true;
}
return true;
}
};