Splay Trees
self adjusting binary search trees
guarantee that any m consecutive tree operations starting from an empty tree take O(m log n) time, where n is the maximum number of elements in tree at any time.
Another way of saying this is that the average cost of an operation (averaged over all the operations) is O(logn). Note: this makes no assumption about the sequence of accesses.
Call this amortized logarithmic cost.