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

1.题目描述：

2. 层序遍历：

/*
// 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 root;
        Queue<Node> queue = new LinkedList<>();
        queue.offer(root);
        while (!queue.isEmpty()) {
            int size = queue.size();
            Node pre = new Node();
            while (size > 0) {
                Node temp = queue.poll();
                size--;
                if (size == 0) temp.next = null;//可省略
                pre.next = temp;
                pre = temp;
                if (temp.left != null) queue.offer(temp.left);
                if (temp.right != null) queue.offer(temp.right);
            }
        }
        return root;
    }
}

3.直接迭代：根据上层next指针来实现，降低空间复杂度。

class Solution {
    public Node connect(Node root) {
        if (root == null) return root;
        Node pre = root;
        while (pre.left != null) {
            Node temp = pre;//帮助横向遍历
            while (temp != null) {//同层向右
                temp.left.next = temp.right;
                if (temp.next != null) temp.right.next = temp.next.left;
                temp = temp.next;
            }
            pre = pre.left;//向下层迭代
        }
        return root;
    }
}

4.递归：思路和直接迭代类似。

class Solution {
    public Node connect(Node root) {
        if (root == null) return root;
        dfs(root);
        return root;
    }

    public void dfs(Node root) {
        if (root.left == null) return;
        root.left.next = root.right;
        if (root.next != null) root.right.next = root.next.left;
        dfs(root.left);
        dfs(root.right);
    }
}