题目:
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
题目分析:
这一题是上一题的延伸。上一题中,给出的是完美二叉树。而这题中,给出的是任意的二叉树。
思路:
- 思路和上一题类似,还是用一个队列queue来广度优先遍历二叉树。
- tag标记所在层的最右边的节点,end标记queue中的最后一个节点。
- 当没有遍历到tag节点时,把节点的next指向queue中头结点。把左孩子、右孩子入队列,更新end指针。
- 当遍历到tag节点时,把节点的next指向null。把左孩子、右孩子入队列,更新end指针。把tag指向end。
注意点:
- 还是Queue接口的应用
代码:
/**
* Definition for binary tree with next pointer.
* public class TreeLinkNode {
* int val;
* TreeLinkNode left, right, next;
* TreeLinkNode(int x) { val = x; }
* }
*/
import java.util.*;
public class Solution {
public void connect(TreeLinkNode root) {
Queue<TreeLinkNode> queue = new LinkedList<TreeLinkNode>();
TreeLinkNode thisNode,tag,end;
thisNode = root;
tag = root;
end = root;
while (thisNode != null){
if (thisNode.left != null){
queue.offer(thisNode.left);
end = thisNode.left;
}
if (thisNode.right != null){
queue.offer(thisNode.right);
end = thisNode.right;
}
if (thisNode == tag){
thisNode.next = null;
tag = end;
thisNode = queue.poll();
}else{
thisNode.next = queue.poll();
thisNode = thisNode.next;
}
}
}
}