LC_116_Populating_Next_Right_Pointers_in_Each_Node.java

/*
Given a binary tree

    struct TreeLinkNode {
      TreeLinkNode *left;
      TreeLinkNode *right;
      TreeLinkNode *next;
    }
Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.

Initially, all next pointers are set to NULL.

Note:

You may only use constant extra space.
You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).
For example,
Given the following perfect binary tree,
         1
       /  \
      2    3
     / \  / \
    4  5  6  7
After calling your function, the tree should look like:
         1 -> NULL
       /  \
      2 -> 3 -> NULL
     / \  / \
    4->5->6->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) {
        
        // empty tree
        if (root == null) {
            return;
        }
        
        TreeLinkNode pre = root;
        TreeLinkNode cur = null;
        
        //level iterate
        while(pre.left != null) {
            cur = pre;//pre is the head node for each level
            while(cur != null) {
                cur.left.next = cur.right;
                if (cur.next != null) {
                    cur.right.next= cur.next.left;
                }
                cur = cur.next;
            }
            pre = pre.left;//next level
        }

        // iterate each level using root.left
        // while (root != null) {
        //    TreeLinkNode p = root;
        //    // iterate each node within the level
        //    while (p != null && p.left != null) {
        //        p.left.next = p.right;
        //        p.right.next = p.next == null ? null : p.next.left;
        //        p = p.next;
        //    }
        //    root = root.left;
        // }
   }
        
    }
}