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:
- You may only use constant extra space.
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) {
//bfs
LinkedList<TreeLinkNode> curr=new LinkedList<TreeLinkNode>();
LinkedList<TreeLinkNode> next=new LinkedList<TreeLinkNode>();
if(root==null) return;
curr.add(root);
while(!curr.isEmpty()){
TreeLinkNode node=curr.pollFirst();
if(node.left!=null) next.add(node.left);
if(node.right!=null) next.add(node.right);
while(!curr.isEmpty()){
TreeLinkNode tmp=curr.pollFirst();
node.next=tmp;
node=node.next;
if(node.left!=null) next.add(node.left);
if(node.right!=null) next.add(node.right);
}
curr=next;
next=new LinkedList<TreeLinkNode>();
}
}
}