116. Populating Next Right Pointers in Each Node
2018-01-17 22:33
267 查看
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
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层次遍历求解,程序如下所示:/**
* Definition for binary tree with next pointer.
* public class TreeLinkNode {
* int val;
* TreeLinkNode left, right, next;
* TreeLinkNode(int x) { val = x; }
* }
*/
public class Solution {
public void connect(TreeLinkNode root) {
if (root == null){
return ;
}
ArrayDeque<TreeLinkNode> que = new ArrayDeque<>();
que.offer(root);
int size = 0;
while (!que.isEmpty()){
size = que.size();
TreeLinkNode tmp;
TreeLinkNode pre = null;
for (int i = 0; i < size; ++ i){
tmp = que.poll();
if (tmp.left != null){
que.offer(tmp.left);
}
if (tmp.right != null){
que.offer(tmp.right);
}
if (pre != null){
pre.next = tmp;
}
pre = tmp;
}
}
}
}
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层次遍历求解,程序如下所示:/**
* Definition for binary tree with next pointer.
* public class TreeLinkNode {
* int val;
* TreeLinkNode left, right, next;
* TreeLinkNode(int x) { val = x; }
* }
*/
public class Solution {
public void connect(TreeLinkNode root) {
if (root == null){
return ;
}
ArrayDeque<TreeLinkNode> que = new ArrayDeque<>();
que.offer(root);
int size = 0;
while (!que.isEmpty()){
size = que.size();
TreeLinkNode tmp;
TreeLinkNode pre = null;
for (int i = 0; i < size; ++ i){
tmp = que.poll();
if (tmp.left != null){
que.offer(tmp.left);
}
if (tmp.right != null){
que.offer(tmp.right);
}
if (pre != null){
pre.next = tmp;
}
pre = tmp;
}
}
}
}
相关文章推荐
- 116. Populating Next Right Pointers in Each Node
- 116. Populating Next Right Pointers in Each Node
- leetCode 116.Populating Next Right Pointers in Each Node (为节点填充右指针) 解题思路和方法
- 【leetcode】116. Populating Next Right Pointers in Each Node【java】
- 116. Populating Next Right Pointers in Each Node LeetCode
- LeetCode 116 Populating Next Right Pointers in Each Node
- [leedcode 116] Populating Next Right Pointers in Each Node
- leetcode oj java 116. Populating Next Right Pointers in Each Node
- [leetcode] 116. Populating Next Right Pointers in Each Node
- 【Leetcode】:116. Populating Next Right Pointers in Each Node 问题 in JAVA
- [LeetCode]:116:Populating Next Right Pointers in Each Node
- [LeetCode] 116. Populating Next Right Pointers in Each Node 每个节点的右向指针
- LeetCode116 Populating Next Right Pointers in Each Node
- leetcode[116]Populating Next Right Pointers in Each Node
- 116. Populating Next Right Pointers in Each Node
- LeetCode 116 Populating Next Right Pointers in Each Node
- leetcode_116题——Populating Next Right Pointers in Each Node(树,广度优先搜索)
- 【LeetCode-面试算法经典-Java实现】【116-Populating Next Right Pointers in Each Node(二叉树链接右指针)】
- LeetCode(116) Populating Next Right Pointers in Each Node
- leetcode——116—— Populating Next Right Pointers in Each Node