Class Solution

Tree/PopulatingNextRightPointersInEachNode.py:58–82

#         self.next = None

class Solution:
    # @param root, a tree link node
    # @return nothing
    def connect(self, root):
        if not root:
            return
        
        current = [root]
        next_nodes = []
        
        while current or next_nodes:
            for i in current:
                if i.left:
                    if next_nodes:
                        next_nodes[-1].next = i.left
                        
                    next_nodes.append(i.left)
                if i.right:
                    if next_nodes:
                        next_nodes[-1].next = i.right
                    
                    next_nodes.append(i.right)
            
            current = next_nodes
            next_nodes = []