117. Populating Next Right Pointers in Each Node II 非常精炼的代码，值得好好体会

题目：

Follow up for problem "Populating Next Right Pointers in Each Node".

What if the given tree could be any binary tree? Would your previous solution still work?

Note:

• You may only use constant extra space.

For example,
Given the following binary tree,

         1
       /  \
      2    3
     / \    \
    4   5    7

After calling your function, the tree should look like:

         1 -> NULL
       /  \
      2 -> 3 -> NULL
     / \    \
    4-> 5 -> 7 -> NULL

代码：

/**
 * Definition for binary tree with next pointer.
 * struct TreeLinkNode {
 *  int val;
 *  TreeLinkNode *left, *right, *next;
 *  TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {}
 * };
 */
class Solution {
public:
    void connect(TreeLinkNode *root) {
        TreeLinkNode *now, *head, *tail;
        now = root;
        head = tail = NULL;
        while(now){
            if(now->left){
                if(tail) tail = tail->next = now->left;
                else head = tail = now->left;
            }
            if(now->right){
                if(tail) tail = tail->next = now->right;
                else head = tail = now->right;
            }
            if(!(now = now->next)){
                now = head;
                head = tail = NULL;
            }
        }
    }
};

讲解：

It's a BFS traversal. now pointer is the current level traveler and head is the left most element at next level and the tail is the right most element at next level till now. We move now pointer at current level and populate the the next-link at its children level. (Here the gist is we can move now to its next because this relationship was already populated in the previous round).