 However the amortized access cost of this worst case is logarithmic, O(log "n").Also, the expected access cost can be reduced to O(log "n") by using a randomized variant.The representation of splay trees can change even when they are accessed in a 'read-only' manner (i.e.