Comparing Leaf and Root Insertion
We consider two ways of inserting a key into a binary search tree: Pot 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 Die Grinder trees trees, in terms of comparisons, are the same in the average case, we show that