题目描述
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
解题思路
思路一:
递归
if (root.right != null && root.next != null) {
right.next = root.next.left;
}
right.next = root.next.left;
}
思路二:
因为是完全二叉树,所以使用变量记录当前层的节点个数,利用队列按层遍历即可。
代码
思路一:
/**
* Given the following perfect binary tree,
1
/ \
2 3
/ \ / \
4 5 6 7
After calling the function, the tree should look like:
1 -> NULL
/ \
2 -> 3 -> NULL
/ \ / \
4->5->6->7 -> NULL
* @param root
*/
public void connect(TreeLinkNode root) {
if (root == null)
return;
TreeLinkNode left = root.left;
TreeLinkNode right = root.right;
if (left != null) {
left.next = right;
}
if (right != null && root.next != null) {
right.next = root.next.left;
}
connect(left);
connect(right);
}
public class TreeLinkNode {
int val;
TreeLinkNode left, right, next;
TreeLinkNode(int x) {
val = x;
}
}
思路二:
/**
* Given the following perfect binary tree,
1
/ \
2 3
/ \ / \
4 5 6 7
After calling the function, the tree should look like:
1 -> NULL
/ \
2 -> 3 -> NULL
/ \ / \
4->5->6->7 -> NULL
* @param root
*/
public void connect(TreeLinkNode root) {
if (root == null)
return;
Queue<TreeLinkNode> queue = new LinkedList<TreeLinkNode>();
TreeLinkNode node = null;
TreeLinkNode lastNode = null;
int currentLevelCount = 1;//记录当前层的节点个数
int level = 0;//记录层数
queue.offer(root);
while (!queue.isEmpty()) {
node = queue.poll();
currentLevelCount--;
if (lastNode != null) {
lastNode.next = node;
}
if (node.left != null && node.right != null) {
queue.add(node.left);
queue.add(node.right);
}
lastNode = node;
//node是当前层的最后一个节点
if (currentLevelCount == 0) {
node.next = null;
level++;
currentLevelCount = 1 << level;
lastNode = null;
}
}
}
public class TreeLinkNode {
int val;
TreeLinkNode left, right, next;
TreeLinkNode(int x) {
val = x;
}
}