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 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.

 

题目理解：

给定一棵二叉树，判断这棵二叉树是否是完全二叉树

解题思路：

借助队列容器层次遍历二叉树，当遇到一个没有右子树的节点之后，这个节点之后遍历到的节点都不能有子树

/**
 * 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> qu = new LinkedList<TreeNode>();
        qu.offer(root);
        boolean flag = true;
        while(!qu.isEmpty()){
            TreeNode cur = qu.poll();
            if(cur.left != null && cur.right != null){
                if(!flag)
                    return false;
                qu.offer(cur.left);
                qu.offer(cur.right);
            }
            else if(cur.left != null){
                if(!flag)
                    return false;
                qu.offer(cur.left);
                flag = false;
            }
            else if(cur.right != null)
                return false;
            else{
                flag = false;
            }
        }
        return true;
    }
}