Return to search

The Complexity of Splay Trees and Skip Lists

Magister Scientiae - MSc / 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. / South Africa

Identiferoai:union.ndltd.org:netd.ac.za/oai:union.ndltd.org:uwc/oai:etd.uwc.ac.za:11394/2465
Date January 2008
CreatorsSayed, Hassan Adelyar.
ContributorsDodds, Reg, Faculty of Science
PublisherUniversity of the Western Cape
Source SetsSouth African National ETD Portal
LanguageEnglish
Detected LanguageEnglish
TypeThesis
RightsUniversity of the Western Cape

Page generated in 0.0019 seconds