Learn
Practice
Newsletter
Resources
F
Toggle theme
0
F
Toggle theme
0
Toggle menu
← Back to All Animations
All Nodes Distance K in Binary Tree
Bookmark
Input
Example 1: target=5, k=2
Example 2: target=2, k=1
Single node: k=0
Complete tree: target=4, k=2
Custom
tree
=
[3, 5, 1, 6, 2, 0, 8, null, null, 7, 4]
,
target
=
5
,
k
=
2
3
5
1
6
2
0
8
7
4
target
queue
visited
current
result
algo
master
.
io
Step:
Start: Find all nodes at distance 2 from target 5
Variable
Value
root
"Node(3)"
target
5
k
2
parent_map
{}
queue
[]
visited
[]
Variable
Value
dist
-
level_size
-
current
-
neighbors
-
neighbor
-
result
[]
0 / 34
Input
Example 1: target=5, k=2
Example 2: target=2, k=1
Single node: k=0
Complete tree: target=4, k=2
Custom
tree
=
[3, 5, 1, 6, 2, 0, 8, null, null, 7, 4]
,
target
=
5
,
k
=
2
0 / 34
3
5
1
6
2
0
8
7
4
target
queue
visited
current
result
algo
master
.
io
Step:
Start: Find all nodes at distance 2 from target 5
Visualization
Variables
