Browsing Magister Scientiae - MSc (Computer Science) by Subject "AVL Trees"

Now showing items 1-1 of 1

  • The Complexity of Splay Trees and Skip Lists 

    Sayed, Hassan Adelyar. (University of the Western Cape, 2008)
    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 ...