Splay Trees

[suchitparikh]

'show that if all nodes in an N node splay tree are accessed once in the increasing key value order then the total access time is O(N) regardless of the initial tree'

-Suchit