Learn
Practice
Newsletter
Resources
Mobile
New
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Populating Next Right Pointers in Each Node II
Bookmark
Input
Example 1
Complete Binary Tree
Sparse Tree
Left-Skewed
Custom
tree
=
[1, 2, 3, 4, 5, null, 7]
1
2
3
4
5
7
L0
L1
L2
queue
connect each level, any tree shape
1
2
3
4
5
7
L0
L1
L2
queue
connect each level, any tree shape
1
2
3
4
5
7
L0
L1
L2
queue
1
front
level 0:
1 node
null
1
2
3
4
5
7
current
L0
L1
L2
queue
2
3
front
enqueue
3
null
1
2
3
4
5
7
current
L0
L1
L2
queue
2
3
front
level 1:
2 nodes
null
1
2
3
4
5
7
current
L0
L1
L2
queue
3
4
front
enqueue
4
null
1
2
3
4
5
7
current
L0
L1
L2
queue
4
5
front
current =
3
null
null
1
2
3
4
5
7
current
L0
L1
L2
queue
4
5
7
front
level 2:
3 nodes
null
null
1
2
3
4
5
7
current
L0
L1
L2
queue
5
7
front
4
.next =
5
null
null
1
2
3
4
5
7
current
L0
L1
L2
queue
current =
7
null
null
null
1
2
3
4
5
7
L0
L1
L2
queue
return root
algo
master
.
io
Step:
Start: connect nodes level by level with BFS
0 / 22
Input
Example 1
Complete Binary Tree
Sparse Tree
Left-Skewed
Custom
tree
=
[1, 2, 3, 4, 5, null, 7]
0 / 22
algo
master
.
io
Step:
Start: connect nodes level by level with BFS
