[leetcode] 116. Populating Next Right Pointers in Each Node 解题报告

题目链接：https://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

思路：因为要求只能用常量空间, 所以肯定不能用队列来遍历树. 可以用一个虚拟头结点来连接每一层, 一层遍历完了之后还可以根据这个虚拟头结点指示的信息, 换到下一层.也就是在遍历当前一层的每个结点的时候连接好子树的链, 这样就可以一层层的完成链接.

代码如下:

/**
 * 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) {
        if(!root) return;
        TreeLinkNode *pHead = new TreeLinkNode(0);
        pHead->next = root;
        while(root)
        {
            if(root->left) root->left->next = root->right;
            if(root->next && root->right) root->right->next = root->next->left;
            root = root->next;
            if(!root) root = pHead->next->left, pHead->next = root;
        }
        delete pHead;
    }
};