Populating Next Right Pointers in Each Node II Solutions in Python

Number 117

Difficulty Medium

Acceptance 39.2%

Other languages C++

Solutions

Python solution by haoel/leetcode

def connect(self, root):
    if not root: return root
    stack = [[root]]
    while True:
        children = [child for node in stack[-1] for child in (node.left, node.right) if child]
        if not children: break
        stack.append(children)
        for i in range(len(children) - 1):
            children[i].next = children[i + 1]

def connect(self, root):
    if not root: return root
    stack = [[root]]
    while True:
        children = [child for node in stack[-1] for child in (node.left, node.right) if child]
        if not children: break
        stack.append(children)
        for i in range(len(children) - 1):
            children[i].next = children[i + 1]