LeetCode——116 填充每个节点的下一个右侧节点指针

问题描述：

给定一个完美二叉树，其所有叶子节点都在同一层，每个父节点都有两个子节点。二叉树定义如下：

struct Node {
  int val;
  Node *left;
  Node *right;
  Node *next;
}
填充它的每个 next 指针，让这个指针指向其下一个右侧节点。如果找不到下一个右侧节点，则将 next 指针设置为 NULL。

初始状态下，所有 next 指针都被设置为 NULL。

输入：{"$id":"1","left":{"$id":"2","left":{"$id":"3","left":null,"next":null,"right":null,"val":4},"next":null,"right":
{"$id":"4","left":null,"next":null,"right":null,"val":5},"val":2},"next":null,"right":
{"$id":"5","left":
{"$id":"6","left":null,"next":null,"right":null,"val":6},"next":null,"right":
{"$id":"7","left":null,"next":null,"right":null,"val":7},"val":3},"val":1}

输出：{"$id":"1","left":{"$id":"2","left":{"$id":"3","left":null,"next":
{"$id":"4","left":null,"next":{"$id":"5","left":null,"next":
{"$id":"6","left":null,"next":null,"right":null,"val":7},"right":null,"val":6},"right":null
,"val":5},"right":null,"val":4},"next":{"$id":"7","left":{"$ref":"5"},"next":null,"right":
{"$ref":"6"},"val":3},"right":{"$ref":"4"},"val":2},"next":null,"right":
{"$ref":"7"},"val":1}

解释：给定二叉树如图 A 所示，你的函数应该填充它的每个 next 指针，以指向其下一个右侧节点，如图 B 所示。

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

执行结果：

代码描述：

思路：参考层遍历，遍历层的同时，将一层的内容放入vector中，放完一层，处理一层。

/*
// Definition for a Node.
class Node {
public:
    int val;
    Node* left;
    Node* right;
    Node* next;

    Node() {}

    Node(int _val, Node* _left, Node* _right, Node* _next) {
        val = _val;
        left = _left;
        right = _right;
        next = _next;
    }
};
*/
class Solution {
public:
    Node* connect(Node* root) {
        if(root == NULL)    return root;
        queue<Node*> q;
        vector<Node*> vec;
        q.push(root);
        root->next = NULL;
        Node* temp = NULL;
        int count = 0;
        while(!q.empty())
        {
            count = q.size(); 
            while(count > 0)
            {
                temp = q.front();
                q.pop();
                if(temp->left != NULL)
                {
                    q.push(temp->left);
                    vec.push_back(temp->left);
                }   
                if(temp->right != NULL)
                {
                    q.push(temp->right);
                    vec.push_back(temp->right);
                } 
                --count;
            }
            if(vec.size() == 0) return root;
            for(int i = 0; i < vec.size() - 1; ++i)
            {
                vec[i]->next = vec[i+1];
            }
            vec[vec.size()-1]->next = NULL;
            vec.clear();
        }
        return root;
    }
};