Comparing leaf and root insertion
| dc.contributor.author | Geldenhuys, Jaco | en_ZA |
| dc.contributor.author | Van der Merwe, Brink | en_ZA |
| dc.date.accessioned | 2019-10-22T10:24:20Z | |
| dc.date.available | 2019-10-22T10:24:20Z | |
| dc.date.issued | 2009 | |
| dc.description | CITATION: Geldenhuys, J. & Van der Merwe, B. 2009. Comparing leaf and root insertion. South African Computer Journal, 44:30-38, doi:10.18489/sacj.v44i0.21. | |
| dc.description | The original publication is available at http://sacj.cs.uct.ac.za | |
| dc.description.abstract | We consider two ways of inserting a key into a binary search tree: leaf insertion which is the standard method, and root insertion which involves additional rotations. Although the respective cost of constructing leaf and root insertion binary search trees trees, in terms of comparisons, are the same in the average case, we show that in the worst case the construction of a root insertion binary search tree needs approximately 50% of the number of comparisons required by leaf insertion. | en_ZA |
| dc.description.uri | http://sacj.cs.uct.ac.za/index.php/sacj/article/view/21 | |
| dc.description.version | Publisher's version | |
| dc.format.extent | 9 pages | |
| dc.identifier.citation | Geldenhuys, J. & Van der Merwe, B. 2009. Comparing leaf and root insertion. South African Computer Journal, 44:30-38, doi:10.18489/sacj.v44i0.21. | |
| dc.identifier.issn | 2313-7835 (online) | |
| dc.identifier.other | doi:10.18489/sacj.v44i0.21 | |
| dc.identifier.uri | http://hdl.handle.net/10019.1/106691 | |
| dc.language.iso | en_ZA | en_ZA |
| dc.publisher | South African Institute of Computer Scientists and Information Technologists | |
| dc.rights.holder | Authors retain copyright | |
| dc.subject | Computer programming | en_ZA |
| dc.subject | Binary search tree | en_ZA |
| dc.title | Comparing leaf and root insertion | en_ZA |
| dc.type | Article | en_ZA |