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

思路：利用广度优先遍历，即可

// 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> queue = new LinkedList<>();
        queue.add(root);
        while (!queue.isEmpty()){
            int size = queue.size();
            for (int i = 0; i < size; i++) {
                Node poll = queue.poll();
                if (i == (size - 1)){
                    poll.next = null;
                }
                if (i < (size - 1)){
                    Node peek = queue.peek();
                    poll.next = peek;
                }
                if (poll.left != null){
                    queue.offer(poll.left);
                    queue.offer(poll.right);
                }
            }
        }
        return root;
    }
}