Dodds, RegSayed, Hassan Adelyar.Faculty of Science2013-11-262024-10-302010/01/142010/01/142013-11-262024-10-302008https://hdl.handle.net/10566/16948Magister Scientiae - MScOur 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.enBinary Search TreesBalanced TreesAVL TreesSelf-adjusting TreesBottom-up Splay TreesThesisUniversity of the Western Cape