On the existence and construction of non-extreme \((a,b)\)-trees. (Q1853114)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the existence and construction of non-extreme \((a,b)\)-trees. |
scientific article; zbMATH DE number 1856454
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the existence and construction of non-extreme \((a,b)\)-trees. |
scientific article; zbMATH DE number 1856454 |
Statements
On the existence and construction of non-extreme \((a,b)\)-trees. (English)
0 references
21 January 2003
0 references
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.
0 references
Data structures
0 references
Analysis of algorithms
0 references
Amortized analysis
0 references
Search trees
0 references
