| dc.contributor.advisor | Dodds, Reg | |
| dc.contributor.author | Sayed, Hassan Adelyar. | |
| dc.contributor.other | | |
| dc.contributor.other | Faculty of Science | |
| dc.date.accessioned | 2013-11-26T18:29:22Z | |
| dc.date.available | 2010/01/14 01:08 | |
| dc.date.available | 2010/01/14 | |
| dc.date.available | 2013-11-26T18:29:22Z | |
| dc.date.issued | 2008 | |
| dc.identifier.uri | http://hdl.handle.net/11394/2465 | |
| dc.description | Magister Scientiae - MSc | en_US |
| dc.description.abstract | 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. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | University of the Western Cape | en_US |
| dc.subject | Binary Search Trees | en_US |
| dc.subject | Balanced Trees | en_US |
| dc.subject | AVL Trees | en_US |
| dc.subject | Self-adjusting Trees | en_US |
| dc.subject | Bottom-up Splay Trees | en_US |
| dc.title | The Complexity of Splay Trees and Skip Lists | en_US |
| dc.type | Thesis | en_US |
| dc.rights.holder | University of the Western Cape | en_US |
| dc.description.country | South Africa | |
