力扣 116. 填充每个节点的下一个右侧节点指针

两道题解法一样

力扣 116. 填充每个节点的下一个右侧节点指针

题目来源：https://leetcode.cn/problems/populating-next-right-pointers-in-each-node/description/

力扣117. 填充每个节点的下一个右侧节点指针 II

题目来源：https://leetcode.cn/problems/populating-next-right-pointers-in-each-node-ii/

 

C++题解：使用队列实现层级遍历，不断将队列首元素的next指向下一个元素，一层结束就将next改指向NULL。

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

    Node() : val(0), left(NULL), right(NULL), next(NULL) {}

    Node(int _val) : val(_val), left(NULL), right(NULL), next(NULL) {}

    Node(int _val, Node* _left, Node* _right, Node* _next)
        : val(_val), left(_left), right(_right), next(_next) {}
};
*/

class Solution {
public:
    Node* connect(Node* root) {
        queue<Node*> que;
        Node* cur;
        if(root != nullptr) que.push(root);
        while(!que.empty()) {
            int len = que.size();
            for(int i = 0; i < len; i++){
                cur = que.front();
                que.pop();
                cur->next = que.front();
                if(cur->left != nullptr) que.push(cur->left);
                if(cur->right != nullptr) que.push(cur->right);
            }
            cur->next = NULL;
        }
        return root; 
    }
};