The Complexity of Splay Trees and Skip Lists
Sayed, Hassan Adelyar.
MetadataShow full item record
Our main results are that splay trees are faster for sorted insertion, where AVL trees are faster for random insertion. For searching, skip lists are faster than single class top-down splay trees, but two-class and multi-class top-down splay trees can behave better than skip lists.