>_
SWE Maxx
Questions
Quizzes
Daily challenge
System design
My attempts
Sign in
☀
☾
Light mode
Dark mode
Loading question…
Sign in
Insert [143, 131, 278, 22, 140, 261, 339] 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 [143, 131, 278, 22, 140, 261, 339] 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 G
Choose a match
278
143
22
140
261
339
131
Marker C
Choose a match
278
143
22
140
261
339
131
Marker F
Choose a match
278
143
22
140
261
339
131
Marker E
Choose a match
278
143
22
140
261
339
131
Marker B
Choose a match
278
143
22
140
261
339
131
Marker A
Choose a match
278
143
22
140
261
339
131
Marker D
Choose a match
278
143
22
140
261
339
131
Check answer
More in Data structures →