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) {
Queue<TreeLinkNode> q = new LinkedList<TreeLinkNode>();
if(root == null) return;
q.offer(root);
q.offer(null);
while(!q.isEmpty()){
TreeLinkNode pre = q.poll();
if(pre == null){
if(!q.isEmpty())
q.offer(null);
continue;
}
pre.next = q.peek();
if(pre.left != null) q.offer(pre.left);
if(pre.right != null) q.offer(pre.right);
}
}
}
解法二:O(1)空间复杂度算法
用指针一层一层遍历
/**
* 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 head = root;
TreeLinkNode cur;
TreeLinkNode pre;
while(head != null){//head表示已经连接好next指针的当前层的第一个节点
pre = null;
cur = head;
while(cur != null){//由连接好next的层连接他们的子节点的next指针
if(cur.left != null){
if(pre == null){
pre = cur.left;
head = cur.left;//第一个节点
}
else{
pre.next = cur.left;
pre = pre.next;
}
}
if(cur.right != null){
if(pre == null){
pre = cur.right;
head = cur.right;
}
else{
pre.next = cur.right;
pre = pre.next;
}
}
cur = cur.next;
}
if(pre == null) head = null;
}
}
}