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

由题意得，就是等于把每一层的结点都从左到右连接起来，每一层的最后一个结点就指向NULL。所以打算用一个next来保存每一层的开头结点，然后用prev来保存每一层上的前一个结点。然后每个结点都会遍历一次，假设有n个结点，那么时间复杂度为O(n)

代码如下：

/**
 * 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) {
        while (root) {
            TreeLinkNode *next = NULL; //next指向下一层次的开头
            TreeLinkNode *prev = NULL;
            while (root) {
                if (!next) {
                    next = (root -> left) ? root -> left : root -> right;//初始化每一层的开头，一旦赋值则不会再执行
                }
                if (root -> left) {
                    if (prev) {
                        prev -> next = root -> left;//假如prev不为NULL，就把它的next赋值为left
                    }
                    prev = root -> left;//前一个结点值改变
                    
                }
                if (root -> right) {
                    if (prev) {
                        prev -> next = root -> right;
                    }
                    prev = root -> right;
                }
                    
                root = root -> next;//上一层之间的移动
            }
            root = next;
        }
    }
};