Populating Next Right Pointers in Each Node II

题目名称
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

分析
  我这里用的是迭代的方法，用两个vector，一个保存当前层的所有结点，一个保存当前层的下一层的所有结点，然后迭代。

C++代码

/**
 * 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;
        vector<TreeLinkNode*> cur;
        cur.push_back(root);
        while(cur.size()>0) {
            vector<TreeLinkNode*> temp;
            for(int i=0;i<cur.size();i++) {
                //如果该节点不为该层的最后一个结点，则它的next指向下一个结点
                if(i!=cur.size()-1) cur[i]->next = cur[i+1];
                //如果该节点为该层的最后一个结点，则它的next为NULL
                else cur[i]->next = NULL;
                if(cur[i]->left) temp.push_back(cur[i]->left);
                if(cur[i]->right) temp.push_back(cur[i]->right);
            }
            cur = temp;
        }
    }
};

总结
  看到很多大神用BFS来解决，时间复杂度为O(n)，小弟的水平还不够，图的搜索算法打算近期重新学习一遍。