# 0117. Populating Next Right Pointers in Each Node II

https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii

## Description

Given a binary tree

```
struct Node {
  int val;
  Node *left;
  Node *right;
  Node *next;
}
```

Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to `NULL`.

Initially, all next pointers are set to `NULL`.

**Example 1:**

![](https://assets.leetcode.com/uploads/2019/02/15/117_sample.png)

```
**Input:** root = [1,2,3,4,5,null,7]
**Output:** [1,#,2,3,#,4,5,7,#]
**Explanation:** Given the above binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B. The serialized output is in level order as connected by the next pointers, with '#' signifying the end of each level.
```

**Example 2:**

```
**Input:** root = []
**Output:** []
```

**Constraints:**

* The number of nodes in the tree is in the range `[0, 6000]`.
* `-100 <= Node.val <= 100`

**Follow-up:**

* You may only use constant extra space.
* The recursive approach is fine. You may assume implicit stack space does not count as extra space for this problem.

## ac

```java
/**
 * Definition for binary tree with next pointer.
 * public class TreeLinkNode {
 *     int val;
 *     TreeLinkNode left, right, next;
 *     TreeLinkNode(int x) { val = x; }
 * }
 */
// dummy node is pretty helpful in linked-list-alike data structure
public class Solution {
    public void connect(TreeLinkNode root) {
        // edge cases
        if (root == null) return;

        TreeLinkNode dummy = new TreeLinkNode(0);
        dummy.next = root;
        TreeLinkNode currParent, curr;
        while (dummy.next != null) {
            currParent = dummy.next;
            curr = dummy;
            while (currParent != null) {
                if (currParent.left != null) {
                    curr.next = currParent.left;
                    curr = curr.next;
                }
                if (currParent.right != null) {
                    curr.next = currParent.right;
                    curr = curr.next;
                }
                currParent = currParent.next;
            }
            curr.next = null;
        }
    }
}
```
