leetcode 1609. 奇偶树-Even Odd Tree

Problem: 1609. 奇偶树-Even Odd Tree广度优先搜索拿到每一层的数值从左到右放入队列若奇偶不满足false若前后大小相同或者不满足falseCodeclass Solution { public: bool isEvenOddTree(TreeNode* root) { queueTreeNode* qe; qe.push(root); int sz, steps -1, a, pre -1, now; TreeNode* ptr; bool large; while(!qe.empty()) { sz qe.size(); steps; a ((steps1)1); if((steps1) 0) large true; else large false; for(int i 0; i sz; i) { ptr qe.front(); now ptr-val; qe.pop(); if(ptr-left!nullptr) qe.push(ptr-left); if(ptr-right!nullptr) qe.push(ptr-right); if(i0 (pre now || (pre now) ! large)) return false; pre now; if((pre 1) ! a) return false; } } return true; } };