LeetCode117.填充每个节点的下一个右侧节点指针II

/*
// 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) 
    {
        deque<Node*> queue;
        if (root == nullptr) return root;
        queue.push_back(root);
        
        while (!queue.empty())
        {
            int size = queue.size();
            for (int i = 0; i < size; i++)
            {
                Node* cur = queue.front();
                queue.pop_front();
                //连接
                if (i < size - 1)
                {
                    cur->next = queue.front();
                }
                else
                    cur->next = nullptr;
                //左右孩子入队
                if (cur->left != nullptr) queue.push_back(cur->left);
                if (cur->right != nullptr) queue.push_back(cur->right);
            }
        }
        return root;
    }
};