"""
# 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)
dq = deque([root])
while dq:
level_size = len(dq)
for idx in range(level_size):
curr = dq.popleft()
if idx != level_size - 1:
curr.next = dq[0]
if curr.left and curr.right:
dq.append(curr.left)
dq.append(curr.right)
return(root)