填充每个节点的下一个右侧节点指针

思路：BFS遍历，遍历的时候每行末尾加个null，然后串联起来。

代码：

/*
// Definition for a Node.
class Node {
    public int val;
    public Node left;
    public Node right;
    public Node next;

    public Node() {}
    
    public Node(int _val) {
        val = _val;
    }

    public Node(int _val, Node _left, Node _right, Node _next) {
        val = _val;
        left = _left;
        right = _right;
        next = _next;
    }
};
*/

class Solution {
    public Node connect(Node root) {
        if (root == null) {
            return null;
        }
        Queue <Node> q = new LinkedList();
        q.add (root);
        while (!q.isEmpty()) {
            int l = q.size();
            Node pre = null;
            for (int i = 0; i < l; i++) {
                Node node = q.poll();
                if (pre != null) {
                    pre.next = node;
                }
                pre = node;
                if (node.left != null) {
                    q.add (node.left);
                }
                if (node.right != null) {
                    q.add (node.right);
                }
            }
        }
        return root;
    }
}