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

最新推荐文章于 2024-06-19 09:16:14 发布

芒果香菠菠

最新推荐文章于 2024-06-19 09:16:14 发布

阅读量338

点赞数 7

文章标签： python 开发语言

本文链接：https://blog.csdn.net/weixin_42396719/article/details/135469827

版权

"""
# 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
"""

class Solution:
    def connect(self, root: 'Optional[Node]') -> 'Optional[Node]':
        if not root:
            return root
        queue = collections.deque([root])
        while queue:
            level_size = len(queue)

            for i in range(level_size):
                node = queue.popleft()
                
                if i == 0:
                    prev = node
                elif i < level_size:
                    prev.next = node
                    prev = node

                
                if node.left:
                    queue.append(node.left)
                if node.right:
                    queue.append(node.right)
                
        return root