思路
层序遍历,用flag记录当前是奇还是偶
代码
/**
* 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) {
queue<TreeNode*> qu;
qu.push(root);
bool flag = 1; //奇偶
while(!qu.empty()) {
int n = qu.size();
//每一层
int tmp = 0;
while(n--){
TreeNode* x = qu.front();
qu.pop();
if(flag == 1) { //奇数递增
if(x->val % 2 == 0) return false;
if(tmp == 0) tmp = x->val;
else {
if(x->val <= tmp) return false;
tmp = x->val;
}
}
else { //偶数递减
if(x->val % 2 == 1) return false;
if(tmp == 0) tmp = x->val;
else {
if(x->val >= tmp) return false;
tmp = x->val;
}
}
if(x->left != nullptr) qu.push(x->left);
if(x->right != nullptr) qu.push(x->right);
}
flag = !flag;
}
return true;
}
};