标签：style blog http color strong io for cti
Populating Next Right Pointers in Each Node II
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
算法思路：
BFS，空间复杂度不是常数【MARK】
偷懒了，跟[leetcode]Populating Next Right Pointers in Each Node一样处理了。
代码如下：
1 public class Solution { 2 public void connect(TreeLinkNode root) { 3 if(root == null) return; 4 Queue<TreeLinkNode> q = new ArrayDeque<TreeLinkNode>(); 5 q.offer(root); 6 root.next = null; 7 Queue<TreeLinkNode> copy = new ArrayDeque<TreeLinkNode>(); 8 while(!q.isEmpty()){ 9 TreeLinkNode tem = q.poll(); 10 tem.next = q.peek(); 11 if(tem.left != null) copy.offer(tem.left); 12 if(tem.right != null) copy.offer(tem.right); 13 if(q.isEmpty()){ 14 for(TreeLinkNode node : copy){ 15 q.offer(node); 16 } 17 copy.clear(); 18 } 19 } 20 } 21 }
[leetcode]Populating Next Right Pointers in Each Node II,布布扣,bubuko.com
[leetcode]Populating Next Right Pointers in Each Node II
标签：style blog http color strong io for cti
原文地址：http://www.cnblogs.com/huntfor/p/3883553.html
