leetcode116. 填充每个节点的下一个右侧节点指针_116. 填充每个节点的下个右侧节点指针-CSDN博客

本文链接：https://blog.csdn.net/weixin_43498985/article/details/108365364

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

struct Node {
int val;
Node *left;
Node *right;
Node *next;
}

填充它的每个 next 指针，让这个指针指向其下一个右侧节点。如果找不到下一个右侧节点，则将 next 指针设置为 NULL。
初始状态下，所有 next 指针都被设置为 NULL。

在这里插入图片描述

输入：{“ $KaTeX parse error: Expected '}', got 'EOF' at end of input: \dots":"1","left":{"$ id”:“2”,“left”:{“ $KaTeX parse error: Expected 'EOF', got '}' at position 53: \dotst":null,"val":4}̲,"next":null,"r\dots$ id”:“4”,“left”:null,“next”:null,“right”:null,“val”:5},“val”:2},“next”:null,“right”:{“ $KaTeX parse error: Expected '}', got 'EOF' at end of input: \dots":"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}

输出：{“ $KaTeX parse error: Expected '}', got 'EOF' at end of input: \dots":"1","left":{"$ id”:“2”,“left”:{“ $KaTeX parse error: Expected '}', got 'EOF' at end of input: \dots:null,"next":{"$ id”:“4”,“left”:null,“next”:{“ $KaTeX parse error: Expected '}', got 'EOF' at end of input: \dots: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”:{“ $KaTeX parse error: Expected '}', got 'EOF' at end of input: \dots":"7","left":{"$ ref”:“5”},“next”:null,“right”:{“ $KaTeX parse error: Expected 'EOF', got '}' at position 9: ref":"6"}̲,"val":3},"righ\dots$ ref”:“4”},“val”:2},“next”:null,“right”:{"$ref":“7”},“val”:1}

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

/*
// 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) {
        if(!root)
            return NULL;
        queue<Node *> que;
        que.push(root);
        while(!que.empty())
        {
            Node * pLastNode = NULL;
            int nSize = que.size();
            for(int nIdx=0;nIdx<nSize;nIdx++)
            {
                Node * pNode = que.front();
                if(nIdx == nSize-1)
                {
                    pNode->next = NULL;
                    pLastNode = pNode;
                    break;
                }
                que.pop();
                pNode->next = que.front();
                if(pNode->left)
                    que.push(pNode->left);
                if(pNode->right)
                    que.push(pNode->right);
            }
            if(pLastNode->left)
                que.push(pLastNode->left);
            if(pLastNode->right)
                que.push(pLastNode->right);
            que.pop();
        }
        return root;
    }
};