insert, delete,
and find, but only averaged over a sequence of operations. But good
constant factors and simple implementation is a win.
The worst-case algorithms are complicated to implement but relatively simple to analyze.
Next we'll talk about splay trees... relatively simple to
implement, but harder to analyze. Gets us insert, delete,
and find, but only averaged over a sequence of operations. But good
constant factors and simple implementation is a win.
