1. (a,b)-Trees As we saw in the previous section, the efficiency of standard operations on binary search trees depends on the maximum tree height. Using height balancing, we ensure that trees cannot degenerate linearly but instead have logarithmic height. Let us extend this approach to more general trees. Motivation: assume tree nodes are stored in secondary storage (hard disk). Comparisons of ...
