-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy path116.py
30 lines (28 loc) · 841 Bytes
/
116.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
"""
# 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 not root:
return None
level = [root]
while True:
newlevel = []
for i, node in enumerate(level):
if i < len(level)-1:
level[i].next = level[i+1]
# print(node.val, end=' ')
if node.left:
newlevel.append(node.left)
newlevel.append(node.right)
if newlevel:
level = newlevel
else:
break
return root