•Using balanced search trees, we can
achieve a high degree of efficiency for implementing our ADT Table
operations.
•This efficiency depends on the balance
of the tree.
•We will find that balanced trees can be
searched
with efficiency comparable to the binary search.
