Populating Next Right Pointers

You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.

30:00

Populating Next Right Pointers

medium

Topics

Companies

You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.

Example 1:

Input: {"root":[1,2,3,4,5,6,7]}

Output: [1,#,2,3,#,4,5,6,7,#]

Constraints:

The number of nodes is in the range $[0, 2^{12} - 1]$ .
$-1000 \leq \text{Node.val} \leq 1000$

Input

arr ={"root":[1,2,3,4,5,6,7]}

Depth

0

1

2

3

4

5

6

7

Variables

Variable	Value
level	0

DepthFunction Call

Stack empty

0/26