Populating Next Right Pointers in Each Node

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 toNULL.

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

01 public void connect(TreeLinkNode root) {
02     if(root==null)  return;
03     if(root.left==null ||root.right==null)
04         return;
05   
06     //set the pointer to the left child
07     root.left.next=root.right;
08   
09     //set the pointer to the right child
10     if(root.next!=null)
11     {
12         root.right.next=root.next.left;
13     }
14     connect(root.left);
15     connect(root.right);
16 }