Please use this identifier to cite or link to this item:
doi:10.22028/D291-26069 | Title: | Binary search trees: average and worst case behavior |
| Author(s): | Güttler, Rainer Mehlhorn, Kurt Schneider, Wolfgang |
| Language: | English |
| Year of Publication: | 1976 |
| OPUS Source: | Saarbrücken, 1976 |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Report |
| Abstract: | 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. |
| Link to this record: | urn:nbn:de:bsz:291-scidok-39850 hdl:20.500.11880/26125 http://dx.doi.org/10.22028/D291-26069 |
| Series name: | Bericht / A / Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes |
| Series volume: | 1976/05 |
| Date of registration: | 20-Jul-2011 |
| Faculty: | MI - Fakultät für Mathematik und Informatik |
| Department: | MI - Informatik |
| Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
| File | Description | Size | Format | |
|---|---|---|---|---|
| fb14_1976_05.pdf | 6,88 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.