A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Binary search trees: average and worst case behavior
[report]
2011
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