LeetCode:Populating Next Right Pointers in Each Node

Solution.java

import com.sun.org.apache.regexp.internal.recompile;

/**
 * Created by thedarkknight on 14-2-15.
 */
public class Solution {
    public void connect(TreeLinkNode root) {
        if (root == null)
            return ;
        if (root.left != null){
           root.left.next = root.right;
        }
        if (root.right != null && root.next!= null)
           root.right.next = root.next.left;
        connect(root.left);
        connect(root.right);

    }
}