https://leetcode.com/problems/populating-next-right-pointers-in-each-node/description/
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.
- You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).
For 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
package go.jacob.day809;
import java.util.LinkedList;
import java.util.Queue;
/**
* 116. Populating Next Right Pointers in Each Node
*
* @author Jacob
*
*/
public class Demo1 {
/*
* 推荐解答
*/
public void connect(TreeLinkNode root) {
TreeLinkNode level_start = root;
while (level_start != null) {
TreeLinkNode cur = level_start;
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;
}
level_start = level_start.left;
}
}
/*
* My Solution
*/
public void connect_2(TreeLinkNode root) {
TreeLinkNode levelFirst = root;
TreeLinkNode cur = levelFirst;
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;
}
if (cur.next != null)
cur = cur.next;
else {
levelFirst = levelFirst.left;
cur = levelFirst;
}
}
}
/*
* 超时算法
*/
public void connect_1(TreeLinkNode root) {
if (root == null)
return;
Queue<TreeLinkNode> queue = new LinkedList<TreeLinkNode>();
queue.offer(root);
while (!queue.isEmpty()) {
int size = queue.size();
for (int i = 0; i < size - 1; i++) {
TreeLinkNode cur = queue.poll();
TreeLinkNode next = queue.peek();
cur.next = next;
if (cur.left != null)
queue.offer(cur.left);
if (cur.right != null)
queue.offer(cur.right);
}
}
}
}