## Insert/delete at log F N cost; keep tree height-balanced. (F = fanout, N = # leaf pages)

## Minimum 50% occupancy (except for root). Each node contains d <= m <= 2d entries. The parameter d is called the order of the tree.

## Supports equality and range-searches efficiently.

Previous slide | Next slide | Back to first slide | View graphic version |