首页 > 代码库 > [leetcode]Populating Next Right Pointers in Each Node II
[leetcode]Populating Next Right Pointers in Each Node II
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 }
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。