958. Check Completeness of a Binary Tree

#code


class Solution {
public:
    bool isCompleteTree(TreeNode* root) {
        
        bool res = true;
        
        queue<TreeNode*> q;
        q.push(root);
        
        TreeNode* node;
        while(!q.empty()){
            node = q.front();
            q.pop();
            if(node == NULL){
                res = false;
            }
            else{
                if(res == false) return false;
                
                q.push(node->left);
                q.push(node->right);
                
            }
        }
        
     return true;
    }
};