LeetCode/1609.cpp at main · HungDongne/LeetCode · GitHub

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
#include <bits/stdc++.h>
#include "BinaryTree.cpp"
#include <queue>
#include <stack>
using namespace std;

void bfs(queue<TreeNode *> &myQueue, int height, int &flag)
{
    if (myQueue.empty())
    {
        return;
    }
    queue<TreeNode *> newQueue;
    if (height % 2 == 1)
    {
        int oldValue = INT_MAX;
        while (!myQueue.empty())
        {
            TreeNode *tmpNode = myQueue.front();
            if (tmpNode->val % 2 == 1 || tmpNode->val >= oldValue)
            {
                flag = 1;
                return;
            }
            oldValue = tmpNode->val;
            if (tmpNode->left != nullptr)
            {
                newQueue.push(tmpNode->left);
            }
            if (tmpNode->right != nullptr)
            {
                newQueue.push(tmpNode->right);
            }
            myQueue.pop();
        }
    }
    else
    {
        int oldValue = INT_MIN;
        while (!myQueue.empty())
        {
            TreeNode *tmpNode = myQueue.front();
            if (tmpNode->val % 2 == 0 || tmpNode->val <= oldValue)
            {
                flag = 1;
                return;
            }
            oldValue = tmpNode->val;
            if (tmpNode->left != nullptr)
            {
                newQueue.push(tmpNode->left);
            }
            if (tmpNode->right != nullptr)
            {
                newQueue.push(tmpNode->right);
            }
            myQueue.pop();
        }
    }
    bfs(newQueue, height + 1, flag);
}
class Solution
{
public:
    Solution()
    {
        ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    }
    bool isEvenOddTree(TreeNode *root)
    {
        int flag = 0;
        queue<TreeNode *> myQueue;
        myQueue.push(root);
        bfs(myQueue, 0, flag);
        return !flag;
    }
};