Comparing Leaf and Root Insertion

Authors

  • Jaco Geldenhuys
  • Brink van der Merwe

DOI:

https://doi.org/10.18489/sacj.v44i0.21

Keywords:

Binary search trees, leaf insertion, root insertion

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.

Published

2010-08-02

Issue

Section

Research Papers