Balancing Algorithms
•The “brute force” technique has a serious drawback
–all of the data must be put in an array before a
balanced tree can be created
–what would happen if you weren’t using pointers to the data but instances of the data?
–if an unbalanced tree is not used (i.e., the data is directly inserted into the array from the client), then
a sorting algorithm must be used and
fixed size issues arise