LeetCode 958 Check Completeness of a Binary Tree (BFS)

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 2h 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:

1. The tree will have between 1 and 100 nodes.

题目链接：https://leetcode.com/problems/check-completeness-of-a-binary-tree/

题目分析：BFS层次遍历，如果一个节点的右端点为空且下一层节点的孩子节点中存在非空节点必然不是完全二叉树，这个约束用来限定高度，对于高度满足要求的二叉树，只需判断倒数第二层的各节点是否存在只有右孩子没有左孩子的情况即可

0ms，时间击败100%

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    
    public boolean isCompleteTree(TreeNode root) {
        if (root == null) {
            return true;
        }
        
        Queue<TreeNode> q = new LinkedList<>();
        q.offer(root);
        boolean hasRightNull = false;
        while (!q.isEmpty()) {
            int sz = q.size();
            for (int i = 0; i < sz; i++) {
                TreeNode cur = q.poll();
                boolean leftNull = cur.left == null;
                boolean rightNull = cur.right == null;            
                if (hasRightNull && (!leftNull || !rightNull)) {
                    return false;
                }
                if (leftNull && !rightNull) {
                    return false;
                }
                hasRightNull |= rightNull;
                if (!leftNull) {
                    q.offer(cur.left);
                }
                if (!rightNull) {
                    q.offer(cur.right);
                }
            }
        }
        return true;
    }
}