116. Populating Next Right Pointers in Each Node

class Solution:
    def connect(self, root: 'Node') -> 'Node':
        if root == None:
            return None
        q = [root]
        while q:
            size = len(q)
            while size > 0:
                node = q.pop(0)
                if size >1:
                    node.next = q[0]
                size-=1
                if node.left:
                    q.append(node.left)
                if node.right:
                    q.append(node.right)
        return root