Year: 2010
Type: article
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.
Source: South African Computer Journal
Authors: Jaco Geldenhuys, Brink Van der Merwe
Institution: Stellenbosch University
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $325
OpenAlex ID: W1879063917
