TY  - RPRT
T1  - Binary search trees: average and worst case behavior
T3  - Saarbrücken, 1976
A1  - Güttler,Rainer
A1  - Mehlhorn,Kurt
A1  - Schneider,Wolfgang
Y1  - 2011/07/20
N2  - 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.
CY  - Saarbrücken
PB  - Universitäts- und Landesbibliothek
AD  - Postfach 151141, 66041 Saarbrücken
UR  - http://scidok.sulb.uni-saarland.de/volltexte/2011/3985
ER  -