116. Populating Next Right Pointers in Each Node

Given a perfect binary tree, where each node has two children and all leaves are at the same depth, update each nodes next pointer to point to its immediate right neighbor at the same level. If there is no neighbor, set the next pointer to None. Return the root node after updating all next' pointers. The input is provided as a binary tree with nodes defined as:

class TreeNode:

def __init__(self, value=0, left=None, right=None, next=None):

self.value = value

self.left = left

self.right = right

self.next = next

The function must update the tree in-place and return the root node.