•Some of the balancing
techniques require constant restructuring
of the tree as data is inserted
–the AVL algorithm uses
this approach
•Some algorithms
consist of build an unbalanced tree and then
reordering the data once the tree is generated
–this can be simple but
depending on the frequency of data being
inserted, it may not be realistic