# 116. Populating Next Right Pointers in Each Node

## Problem

Given a binary tree

```
struct TreeLinkNode {
TreeLinkNode *left;
TreeLinkNode *right;
TreeLinkNode *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.

Note:

You may only use constant extra space.

Recursive approach is fine, implicit stack space does not count as extra space for this problem.

You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).

Example:

Given the following perfect binary tree,

```
1
/ \
2 3
/ \ / \
4 5 6 7
```

After calling your function, the tree should look like:

```
1 -> NULL
/ \
2 -> 3 -> NULL
/ \ / \
4->5->6->7 -> NULL
```

## Code

```
class Solution {
public Node connect(Node root) {
if(root == null) return root;
Node curr = root;
while(curr != null){
// 保存一开始的curr,之后得到下一层的起点
Node head = curr;
while(curr != null){
if(curr.left != null){
curr.left.next = curr.right;
}
if(curr.right != null && curr.next != null){
curr.right.next = curr.next.left;
}
curr = curr.next;
}
curr = head.left;
}
return root;
}
}
```

按 <- 键看上一题！
115. Distinct Subsequences