958. Check Completeness of a Binary Tree**

958. Check Completeness of a Binary Tree**

https://leetcode.com/problems/check-completeness-of-a-binary-tree/

题目描述

Given a binary tree, determine if it is a complete binary tree.

Definition of a complete binary tree from Wikipedia:
In a complete binary tree every level, except possibly the last, is completely filled, and all nodes in the last level are as far left as possible. It can have between $1$ and $2^h$ nodes inclusive at the last level $h$.

Example 1:

Input: [1,2,3,4,5,6]
Output: true
Explanation: Every level before the last is full (ie. levels with node-values {1} and {2, 3}), and all nodes in the last level ({4, 5, 6}) are as far left as possible.

Example 2:

Input: [1,2,3,4,5,null,7]
Output: false
Explanation: The node with value 7 isn't as far left as possible.

Note:

• The tree will have between 1 and 100 nodes.

C++ 实现 1

判断是否为完全二叉树. 下面采用层序遍历的方法, 与平时不同点在于, 如果某节点的孩子为空, 也要加入到队列中. 当从队列中读取节点时, 使用 end 来标注首次遇到了为空的节点, 这说明已经到了二叉树的结尾. 之后继续从队列中读取节点, 如果在 end 为 true 的情况下, 队列中还存在非空的节点, 说明这棵树不是完全二叉树.

代码参考: Java easy Level-Order Traversal, one while-loop

When level-order traversal in a complete tree, after the last node, all nodes in the queue should be null. Otherwise, the tree is not complete.

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