Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set toNULL.
Initially, all next pointers are set to NULL.
Note:
- You may only use constant extra space.
- You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).
public class Solution {
public void connect(TreeLinkNode root) {
while (root != null) {
TreeLinkNode cur = root;
while (cur != null) {
if (cur.left != null)
cur.left.next = cur.right;
if (cur.right != null && cur.next != null)
cur.right.next = cur.next.left;
cur = cur.next;
}
root = root.left;
}
}
}
116. Populating Next Right Pointers in Each Node
原文：https://www.cnblogs.com/MarkLeeBYR/p/10536466.html
