判断是否为完全二叉树——无非就是判断二叉树用队列中序遍历时出队的元素

 

import java.util.*;

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 *   public TreeNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 
     * @param root TreeNode类 
     * @return bool布尔型
     */
    public boolean isCompleteTree (TreeNode root) {
        // write code here
        if(root == null){
            return true;
        }
        Queue<TreeNode> queue = new LinkedList();
        queue.offer(root);
        boolean isnull = false;
        TreeNode p;
        while(!queue.isEmpty()){
            p = queue.poll(); // 从出栈元素入手
            if(p == null){ // 如果出栈的元素第一次遇到了null，就标记isnull
                isnull = true;
                continue;
            } 
            if( isnull ){
                return false;
            }
            queue.offer(p.left);
            queue.offer(p.right);
        }
        return true;
    }
}