>_
SWE Maxx
Questions
Quizzes
Daily challenge
System design
My attempts
Sign in
☀
☾
Light mode
Dark mode
Loading question…
Sign in
Insert [105, 89, 199, 52, 99, 172, 289] into an empty binary search tree in this order. Label markers A–G with their resulting keys. | SWE Maxx
← Question bank
Data structures · Labeling
Difficulty: Hard
Insert [105, 89, 199, 52, 99, 172, 289] into an empty binary search tree in this order. Label markers A–G with their resulting keys.
Binary search trees
Diagram labels
Choose a match for every item. Use each answer once.
Marker E
Choose a match
99
105
172
89
289
52
199
Marker F
Choose a match
99
105
172
89
289
52
199
Marker A
Choose a match
99
105
172
89
289
52
199
Marker C
Choose a match
99
105
172
89
289
52
199
Marker B
Choose a match
99
105
172
89
289
52
199
Marker D
Choose a match
99
105
172
89
289
52
199
Marker G
Choose a match
99
105
172
89
289
52
199
Check answer
More in Data structures →