Because we have no control over the arrival order of values, a binary search tree cannot guaranteed to be complete. As a result, it may be necessary to balance a binary search tree that is not balanced.
A balancing act often requires the restructuring of a tree. This requires some operations that are not defined in the tree ADT of module 0096. This section outlines these operations.