标签：style color io ar java for strong sp div
Follow up for problem "Populating Next Right Pointers in Each Node".
What if the given tree could be any binary tree? Would your previous solution still work?
Note:
For example,
Given the following binary tree,
1
/ 2 3
/ \ 4 5 7
After calling your function, the tree should look like:
1 -> NULL
/ 2 -> 3 -> NULL
/ \ 4-> 5 -> 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 ;
}
TreeLinkNode firstUpper=root;
TreeLinkNode pUpper;
TreeLinkNode firstBelow=null;
TreeLinkNode pBelow=null;
while(firstUpper!=null)
{
pUpper=firstUpper;
while(pUpper!=null)
{
if(pUpper.left!=null)
{
if(firstBelow==null)
{
firstBelow=pUpper.left;
pBelow=firstBelow;
}
else
{
pBelow.next=pUpper.left;
pBelow=pBelow.next;
}
}
if(pUpper.right!=null)
{
if(firstBelow==null)
{
firstBelow=pUpper.right;
pBelow=firstBelow;
}
else
{
pBelow.next=pUpper.right;
pBelow=pBelow.next;
}
}
pUpper=pUpper.next;
}
firstUpper=firstBelow;
firstBelow=null;
}
}
}Populating Next Right Pointers in Each Node II
标签：style color io ar java for strong sp div
原文地址：http://blog.csdn.net/jiewuyou/article/details/39957155
