Why do binary search trees need to be balanced?
A:
saves search time
B:
saves memory
C:
easier to draw
D:
unbalanced trees may cause errors
E:
A, B, and C
Answer
Contents
Page-10
Prev
Next
Page+10
Index