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

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

Code

"""
# Definition for a Node.
class Node:
    def __init__(self, val: int = 0, left: 'Node' = None, right: 'Node' = None, next: 'Node' = None):
        self.val = val
        self.left = left
        self.right = right
        self.next = next
"""
from collections import deque
class Solution:
    def connect(self, root: 'Optional[Node]') -> 'Optional[Node]':
        if not root: return root
        q = deque()
        q.append(root)
        while q:
            length = len(q)
            for i in range(0, length):
                node = q.popleft()
                if i < length - 1: node.next = q[0]
                if node.left: q.append(node.left)
                if node.right: q.append(node.right)
        return root

/*
// 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 == nullptr) return root;
        // 初始化队列同时将第一层节点加入队列中，即根节点
        queue<Node*> Q;
        Q.push(root);
        // 外层的 while 循环迭代的是层数
        while (!Q.empty()) {
            // 记录当前队列大小
            int length = Q.size();
            // 遍历这一层的所有节点
            for(int i = 0; i < length; i++) {
                // 从队首取出元素
                Node* node = Q.front();
                Q.pop();
                // 连接
                if (i < length - 1) node->next = Q.front();
                // 拓展下一层节点
                if (node->left != nullptr) Q.push(node->left);
                if (node->right != nullptr) Q.push(node->right);
            }
        }
        // 返回根节点
        return root;
    }
};