116. Populating Next Right Pointers in Each Node - LeetCode Solution

"""
# 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':
        q = [root, None]
        count = 0
        
        while len(q) != 0:
            k = q.pop(0)
            
            if k== None:
                q.append(None)
                count+=1
                if count >1:
                    break
                continue
            k.next = q[0]
            count = 0
            
            if k.left:
                q.append(k.left)
            if k.right:
                q.append(k.right)
        return root