102.二叉树的层序遍历及其变形

题目描述：给定一个二叉树，返回其按层次遍历的节点值。 （即逐层地，从左到右访问所有节点）。

例如:给定二叉树: [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7
返回其层次遍历结果：

[
  [3],
  [9,20],
  [15,7]
]

思路：根入队列，直到队列为空之前，取队首结点，然后将该节点的孩子入队列。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    private static class nodeLevel{
        TreeNode node;
        int level;
        nodeLevel(TreeNode node,int level){
            this.node = node;
            this.level = level;
        }
    }
    public List<List<Integer>> levelOrder(TreeNode root) {
        if(root == null){
            return new ArrayList<>();
        }
        List<List<Integer>> ret = new ArrayList<>();
        Queue<nodeLevel> queue = new LinkedList<>();
        queue.offer(new nodeLevel(root,0));
        while(!queue.isEmpty()){
            nodeLevel front = queue.poll();
            if(ret.size() == front.level){
                ret.add(new ArrayList<>());
            }
            List<Integer> list = ret.get(front.level);
            list.add(front.node.val);
            if(front.node.left != null){
                queue.offer(new nodeLevel(front.node.left,front.level + 1));
            }
            if(front.node.right != null){
                queue.offer(new nodeLevel(front.node.right,front.level + 1));
            }
        }
        return ret;
    }
}

 层序遍历及判断一棵树是不是完全二叉树。判断准则，完全二叉树的层序遍历写出后中间没有空节点。

public static void levelOrder(TreeNode root){
    if(root == null){
        return;
    }
    Queue<TreeNode> queue = new LinkedList<>();
    queue.offer(root);
    while(!queue.isEmpty()){
        TreeNode front = queue.poll();
        System.out.print(front.val+" ");
        if(front.left != null){
            queue.offer(front.left);
        }
        if(front.right != null){
            queue.offer(front.right);
        }
    }
}
public static boolean isCompleteTree(TreeNode root){
        if(root == null){
            return true;
        }
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        while(true){
            TreeNode front = queue.poll();
            if(front == null){// 当遇到的结点不为空直接退出循环
                break;
            }
            queue.offer(front.left);
            queue.offer(front.right);
        }
        // 检查队列是否全为空
        while(!queue.isEmpty()){
            TreeNode n = queue.poll();
            if(n != null){
                return false;
            }
        }
        return true;
}