Populating Next Right Pointers in Each Node

Iterative

/**
 * 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 cur = root;
        TreeLinkNode nextLevel = cur.left;
        while (cur != null && nextLevel != null) {
            TreeLinkNode prev = cur.left;
            while (cur != null) {
                if (prev != cur.left) {
                    prev.next = cur.left;
                    prev = prev.next;
                }
                prev.next = cur.right;
                prev = prev.next;
                cur = cur.next;
            }
            cur = nextLevel;
            nextLevel = cur.left;
        }       
    }
}