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

思路: 跟I一样，root在上面走，下面在连接，这里跟I不一样的是，左右node可能缺失，所以要用cur node记录当前的cur，然后继续走，分root.left != null 和root.right != null两种情况；然后再用temp点hold住起始node，传给root = temp.next;

class Solution {
    public Node connect(Node root) {
        if(root == null) {
            return null;
        }
        Node head = root;
        while(root != null) {
            Node temp = new Node(-1);
            Node cur = temp;
            while(root != null) {
                if(root.left != null) {
                    cur.next = root.left;
                    cur = cur.next;
                }
                if(root.right != null) {
                    cur.next = root.right;
                    cur = cur.next;
                }
                root = root.next;
            }
            root = temp.next;
        }
        return head;
    }
}