SurpoistAteworfr
@surpoistateworfr
Binary search is fast for reads, but not for inserts. Balanced trees are better for both read and insert efficiency.
0 reply
0 recast
1 reaction