>_
SWE Maxx
Questions
Quizzes
Daily challenge
System design
My attempts
Sign in
☀
☾
Light mode
Dark mode
Loading question…
Sign in
Insert [226, 214, 265, 53, 224, 257, 310] 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 [226, 214, 265, 53, 224, 257, 310] 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 C
Choose a match
257
310
224
214
226
53
265
Marker A
Choose a match
257
310
224
214
226
53
265
Marker D
Choose a match
257
310
224
214
226
53
265
Marker G
Choose a match
257
310
224
214
226
53
265
Marker E
Choose a match
257
310
224
214
226
53
265
Marker B
Choose a match
257
310
224
214
226
53
265
Marker F
Choose a match
257
310
224
214
226
53
265
Check answer
More in Data structures →