116. Populating Next Right Pointers in Each Node

116. Populating Next Right Pointers in Each Node
Given the following perfect binary tree,
     1 -> null
   /  \
  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




// i understand the solution,but idk how to come up with the solution
// iterative
public class Solution {
    public void connect(TreeLinkNode root) {
        TreeLinkNode level_start=root;
        while(level_start!=null){
            TreeLinkNode cur=level_start;
            while(cur!=null){
                if(cur.left!=null) cur.left.next=cur.right;
                if(cur.right!=null && cur.next!=null) cur.right.next=cur.next.left;
                
                cur=cur.next;
            }
            level_start=level_start.left;
        }
    }
}

// recursive 
// is this preorder traversal?? 
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){
        if(root.next != null){
          root.right.next = root.next.left;
        }else{
          root.right.next = null;
        }
      }
      
      connect(root.left);
      connect(root.right);
        
    }
}

 

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.
• Recursive approach is fine, implicit stack space does not count as extra space for this problem.
• You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).

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