LeetCode 116Populating Next Right Pointers in Each Node

LeetCode 116 Populating Next Right Pointers in Each Node Problem

``````# Definition for binary tree with next pointer.
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
#         self.next = None

class Solution(object):
def connect(self, root):
"""
:rtype: nothing
"""
if root is None:
return
nodes = [root]
while len(nodes) != 0:
next_step = []
last = None
for node in nodes:
if last is not None:
last.next = node
if node.left is not None:
next_step.append(node.left)
if node.right is not None:
next_step.append(node.right)
last = node
nodes = next_step

``````

List of all Populating Next Right Pointers in Each Node problems

Leetcode 116 Populating Next Right Pointers in Each Node problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.

self.val = x

self.left = None

Feedback is the most important part of any website.