On the existence and construction of non-extreme (a,b)-trees |
| |
| Authors: | Lars Jacobsen Kim S. Larsen Morten N. Nielsen |
| |
| Affiliation: | Department of Mathematics and Computer Science, University of Southern Denmark, Main campus: Odense University, Campusvej 55, DK-5230 Odense M, Denmark |
| |
| Abstract: | In amortized analysis of data structures, it is standard to assume that initially the structure is empty. Usually, results cannot be established otherwise. In this paper, we investigate the possibilities of establishing such results for initially non-empty multi-way trees. |
| |
| Keywords: | Data structures Analysis of algorithms Amortized analysis Search trees |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
