[leetcode-116]Populating Next Right Pointers in Each Node(c++)

问题描述：

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
Show Tags
Show Similar Problems

分析：这道题其实也是和前几道利用树结构的问题很类似，使用一个队列的数据结构，先进先出，然后出队列的过程中，将节点串在一起。
补充：还在想这题怎么这么简单，原来是忽略了题目中重要的要求，即使用常数空间，那么无论代码1的广搜还是代码2的递归都不能再使用。请见代码3，使用迭代的做法。

代码如下：28ms

class Solution {
public:
    void connect(TreeLinkNode *root) {
        if (!root)
            return;
        queue<TreeLinkNode *> queue;
        queue.push(root);
        int count = 1;

        while (!queue.empty()) {
            int tmpCount = 0;
            TreeLinkNode* head = NULL;
            for (int i = 0; i < count; i++) {
                TreeLinkNode* tmp = queue.front();
                queue.pop();

                if(tmp->left)
                    queue.push(tmp->left);
                if(tmp->right)
                    queue.push(tmp->right);

                if (!head)
                    head = tmp;
                else {
                    head->next = tmp;
                    head = tmp;
                }
                tmpCount += 2;
            }
            count = tmpCount;
        }
    }
};

---

无意间在网上看到了另外一种解法，非常简洁。它利用的是递归的思想（对于树这么结构化的数据而言，确实应该想到）。利用的对于某个root，链接它的child。对于右子节点，链接root->next的左子节点。然后递归下去。

/**
 * 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||!root->left)
            return;
        root->left->next = root->right;
        if(root->next)
            root->right->next = root->next->left;

        connect(root->left);
        connect(root->right);
    }
};

---

代码3:

/**
 * 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;

        while(root->left){
            TreeLinkNode *cur = root;
            while(cur->next){
                cur->left->next = cur->right;
                cur->right->next = cur->next->left;

                cur = cur->next;
            }
            cur->left->next = cur->right;
            root = root->left;
        }
    }
};