Now showing items 1-1 of 1
Comparing leaf and root insertion
(South African Institute of Computer Scientists and Information Technologists, 2009)
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 ...