脚本宝典收集整理的这篇文章主要介绍了[LeetCode] 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
Solution
BFS
public class Solution {
public void connect(TreeLinkNode root) {
if (root == null) return;
Deque<TreeLinkNode> queue = new ArrayDeque<>();
queue.offer(root);
while (!queue.isEmpty()) {
int size = queue.size();
for (int i = 0; i < size; i++) {
TreeLinkNode cur = queue.poll();
if (cur.left != null) queue.offer(cur.left);
if (cur.right != null) queue.offer(cur.right);
if (i != size-1) cur.next = queue.peek();
else cur.next = null;
}
}
}
}
Recursive
public class Solution {
public void connect(TreeLinkNode root) {
if (root == null) return;
if (root.left != null) root.left.next = root.right;
if (root.next != null && root.right != null) root.right.next = root.next.left;
connect(root.left);
connect(root.right);
}
}
以上是脚本宝典为你收集整理的[LeetCode] 116. Populating Next Right Pointers in Each Node全部内容,希望文章能够帮你解决[LeetCode] 116. Populating Next Right Pointers in Each Node所遇到的问题。
本图文内容来源于网友网络收集整理提供,作为学习参考使用,版权属于原作者。
如您有任何意见或建议可联系处理。小编QQ:384754419,请注明来意。