A binary search tree that needs no balance information. Search time is logarithmic, and the amortized cost of update is logarithmic.