Populating Next Right Pointers in Each Node
来源:互联网 发布:import form js 编辑:程序博客网 时间:2024/06/13 07:08
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.
- 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
Solution:
/**
* 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;
TreeLinkNode head=root,p;
while(head.left!=null)
{
p = head;
while(p.next!=null)
{
p.left.next = p.right;
p.right.next = p.next.left;
p = p.next;
}
p.left.next = p.right;
head = head.left;
}
}
}
* 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;
TreeLinkNode head=root,p;
while(head.left!=null)
{
p = head;
while(p.next!=null)
{
p.left.next = p.right;
p.right.next = p.next.left;
p = p.next;
}
p.left.next = p.right;
head = head.left;
}
}
}
0 0
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Single Number II
- Pascal's Triangle
- linux常见权限相关错误及解决
- Pascal's Triangle II
- hdu3072——Intelligence System
- Populating Next Right Pointers in Each Node
- 2014年9月15日 停车费应该上涨吗
- Populating Next Right Pointers in Each Node II
- Distinct Subsequences
- Flatten Binary Tree to Linked List
- 常用 索引 约束 查询--格式不变(插入代码-->SQL)
- Jlink无法连接电脑的解决办法
- UNP卷1:第十三章(守护进程和inetd超级服务器)
- Path Sum II