Binary search trees: average and worst case behavior [report]

Rainer Güttler, Kurt Mehlhorn, Wolfgang Schneider, Universität Des Saarlandes, Universität Des Saarlandes
We discuss several simple strategies for constructing binary search trees. Upper and lower bounds for the average and worst case search time in trees constructed according to these strategies are derived. Furthermore, different implementations are discussed and the results are applied to digital searching.
doi:10.22028/d291-26069 fatcat:zibiaqwh4jd4vodsd75d7xj42e