LeetCode解题分享：117. Populating Next Right Pointers in Each Node II

最新推荐文章于 2023-03-11 16:53:38 发布

子为空

最新推荐文章于 2023-03-11 16:53:38 发布

阅读量414

点赞数

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/davincil/article/details/100136673

版权

LeetCode 专栏收录该内容

43 篇文章 0 订阅

订阅专栏

problem

Given a binary tree

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

Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.

Initially, all next pointers are set to NULL.

Example:

在这里插入图片描述

Input: {"$id":“1”,“left”:{"$id":“2”,“left”:{"$id":“3”,“left”:null,“next”:null,“right”:null,“val”:4},“next”:null,“right”:{"$id":“4”,“left”:null,“next”:null,“right”:null,“val”:5},“val”:2},“next”:null,“right”:{"$id":“5”,“left”:null,“next”:null,“right”:{"$id":“6”,“left”:null,“next”:null,“right”:null,“val”:7},“val”:3},“val”:1}
Output: {"$id":“1”,“left”:{"$id":“2”,“left”:{"$id":“3”,“left”:null,“next”:{"$id":“4”,“left”:null,“next”:{"$id":“5”,“left”:null,“next”:null,“right”:null,“val”:7},“right”:null,“val”:5},“right”:null,“val”:4},“next”:{"$id":“6”,“left”:null,“next”:null,“right”:{"$ref":“5”},“val”:3},“right”:{"$ref":“4”},“val”:2},“next”:null,“right”:{"$ref":“6”},“val”:1}
Explanation: Given the above binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B.

Note:

You may only use constant extra space.
Recursive approach is fine, implicit stack space does not count as extra space for this problem.

解题思路

"""
# Definition for a Node.
class Node:
    def __init__(self, val, left, right, next):
        self.val = val
        self.left = left
        self.right = right
        self.next = next
"""
class Solution:
    def connect(self, root: 'Node') -> 'Node':
        if root is None:
            return None
        
        queue = [root]
        
        while len(queue) != 0:
            
            length = len(queue)
            previous = None
            for _ in range(length):
                node = queue.pop(0)
                
                if previous is None:
                    previous = node
                else:
                    previous.next = node
                    previous = node
                
                if node.left:
                    queue.append(node.left)
                if node.right:
                    queue.append(node.right)
        return root