填充每个节点的下一个右侧节点指针 II · 交互式算法学习

这是一组同题正确实现，独立于上方当前动画方法；不同语言可能采用另一种正确策略。

1/*2// Definition for a Node.3class Node {4    public int val;5    public Node left;6    public Node right;7    public Node next;8 9    public Node() {}10 11    public Node(int _val) {12        val = _val;13    }14 15    public Node(int _val, Node _left, Node _right, Node _next) {16        val = _val;17        left = _left;18        right = _right;19        next = _next;20    }21};22*/23 24class Solution {25    public Node connect(Node root) {26        if (root == null) {27            return root;28        }29        Deque<Node> q = new ArrayDeque<>();30        q.offerLast(root);31        while (!q.isEmpty()) {32            Node p = null;33            for (int n = q.size(); n > 0; --n) {34                Node node = q.pollFirst();35                if (p != null) {36                    p.next = node;37                }38                p = node;39                if (node.left != null) {40                    q.offerLast(node.left);41                }42                if (node.right != null) {43                    q.offerLast(node.right);44                }45            }46        }47        return root;48    }49}