No.287 - LeetCode[958] Check Completeness of a Binary Tree - BFS

/*
 * @lc app=leetcode id=958 lang=cpp
 *
 * [958] Check Completeness of a Binary Tree
 */

// @lc code=start
/**
 * 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 isCompleteTree(TreeNode* root) {
        if(root == nullptr) return true;
        queue<TreeNode*> q;
        q.push(root);
        while(!q.empty()){
            TreeNode* now = q.front(); q.pop();
            if(now->left == nullptr && now->right != nullptr){
                return false;
            }else if(now->left != nullptr && now->right == nullptr) {
                if(now->left->left != nullptr || now->left->right != nullptr) return false;
                while(!q.empty()){
                    TreeNode* t = q.front(); q.pop();
                    if(t->left != nullptr || t->right != nullptr) return false;
                }
                return true;
            }
            else if(now->left == nullptr && now->right == nullptr){
                while(!q.empty()){
                    TreeNode* t = q.front(); q.pop();
                    if(t->left != nullptr || t->right != nullptr) return false;
                }
                return true;
            }else {
                q.push(now->left);
                q.push(now->right);
            }
        }
        return true;
    }
};
// @lc code=end