"""
# Definition for a Node.
class Node(object):
def __init__(self, val=0, left=None, right=None, next=None):
self.val = val
self.left = left
self.right = right
self.next = next
"""
# 与116题相同
from collections import deque
class Solution(object):
def connect(self, root):
"""
:type root: Node
:rtype: Node
"""
if not root:
return None
que = deque([root])
while que:
node_size = len(que)
for i in range(node_size):
cur = que.popleft()
if i < node_size - 1:
cur.next = que[0]
if cur.left:
que.append(cur.left)
if cur.right:
que.append(cur.right)
return root
填充每个节点的下一个右侧节点指针II python(leetcode116)
最新推荐文章于 2024-07-21 15:36:00 发布