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

我的方法,使用颜色层次遍历法,依次填next:

"""
# 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: 'Node') -> 'Node':
        white = 1
        gray = 0
        level = 0
        stack = [(white, root, level),]
        res = []
        
        if root is None:return
        
        while stack:
            color, root, level = stack.pop()
            if root is None: continue
            if color:
                stack.append((white, root.right, level+1))
                stack.append((white, root.left, level+1))
                stack.append((gray, root, level))
            else:
                if res.__len__() < level + 1:
                    res.append([root])
                elif res[level].__len__() == 2 ** (level) - 1:
                    res[level][0].next = root
                    root.next = None
                else:
                    res[level][0].next = root
                    res[level][0] = root
        return res[0][0]

递归法:

"""
# 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: 'Node') -> 'Node':
        if root is None: #针对输入为[]这种特殊情况
            return root
        if root.left is None and root.next is None: #针对输入为[1]这种情况
            root.next = None
            return root
        if root.left is None: #不会让程序访问到最后一层,在倒数第二层就停了
            return root
        if root.next is None:
            root.left.next = root.right
            root.right.next = None
        else:
            root.left.next = root.right
            root.right.next = root.next.left
        
        self.connect(root.left)
        self.connect(root.right)

        return root

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值