leetcode populating-next-right-pointers-in-each-node 链表中同一层的结点连接起来

简单点就是，给定完全二叉树，将它每一层的顶点串起来

Given a binary tree

    struct TreeLinkNode {
      TreeLinkNode *left;
      TreeLinkNode *right;
      TreeLinkNode *next;
    }

For example
Given the following perfect binary tree,

For example,
Given the following perfect binary tree,
         1
       /  \
      2    3
     / \  / \
    4  5  6  7

After calling your function, the tree should look like:
         1 -> NULL
       /  \
      2 -> 3 -> NULL
     / \  / \
    4->5->6->7 -> NULL

用BFS做

/**
 * Definition for binary tree with next pointer.
 * public class TreeLinkNode {
 *     int val;
 *     TreeLinkNode left, right, next;
 *     TreeLinkNode(int x) { val = x; }
 * }
 */
import java.util.*;
public class Solution {
    public void connect(TreeLinkNode root) {
        if(root==null) return ;
        LinkedList<TreeLinkNode> que = new LinkedList<>();
        que.add(root);
        while(!que.isEmpty()){
            int size = que.size();
            for(int i=0;i<size;i++){
                TreeLinkNode cur = que.poll();//获取并删除
                if(i==size-1){
                    cur.next=null;//该层最后一个结点
                }
                else{
                    cur.next = que.peek();//获取que中的第一个元素但不删除
                }
                if(cur.left!=null){
                    que.add(cur.left);
                }
                if(cur.right!=null){
                    que.add(cur.right);
                }
            }
        }
    }
}