leetcode第34.35题（populating-next-right-pointers-in-each-node）

题目：

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

思路：每一层相当于是一个链表，在最后一个结点的next指向null（两题的代码一样即可通过）

代码：

/**
 * Definition for binary tree with next pointer.
 * public class TreeLinkNode {
 *     int val;
 *     TreeLinkNode left, right, next;
 *     TreeLinkNode(int x) { val = x; }
 * }
 */
import java.util.LinkedList;
import java.util.Queue;
public class Solution {
    public void connect(TreeLinkNode root) {
        if(root == null)
            return;
        Queue<TreeLinkNode> queue = new LinkedList<>();
        queue.offer(root);

        while(!queue.isEmpty()){
            int len = queue.size();
            for(int i = 0; i < len; i++){
                TreeLinkNode tmp = queue.poll();
                if(i == len - 1){
                    tmp.next = null;
                }else {
                    tmp.next = queue.peek();
                }
                if(tmp.left != null)
                    queue.offer(tmp.left);
                if(tmp.right != null)
                    queue.offer(tmp.right);
            }
        }
    }
}

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