Populating Next Right Pointers in Each Node

Populating Next Right Pointers in Each Node

http://oj.leetcode.com/problems/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 to NULL.

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

//测试通过

//借鉴基本的深度遍历方法-关键所在将俩子树间的空隙链接起来---》关键所在（见上图红色部分）

void connect(TreeLinkNode *root) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        
       if(root == NULL) return ;
       
       TreeLinkNode *left,*right;
       left = root->left;
       right = root->right;
       
       while(left&&right)//将俩子树间的空隙链接起来---》关键所在
       {
           left->next = right;
           
           left = left->right;//走向下一层
           right = right->left;
       }
       
       connect(root->left);//遍历左边
       connect(root->right);//遍历右边
        
    }