10_0_Populating Next Right Pointers in Each Node

/**
 * 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 lnode = root.left;
        TreeLinkNode rnode = root.right;
        if(lnode != null && rnode !=null){
            lnode.next = rnode;
        }
        if(rnode ==null) rnode = lnode;
        if(rnode == null) return;
        link(rnode, root.next);
        connect(rnode);
        connect(lnode);
    }
    public void link(TreeLinkNode rnode, TreeLinkNode n){
      if(n!=null) rnode.next = n.left;
    }
}