Analysis of the standard deletion algorithms in exact fit domain binary search trees (Q911249)
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: Analysis of the standard deletion algorithms in exact fit domain binary search trees |
scientific article; zbMATH DE number 4141472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of the standard deletion algorithms in exact fit domain binary search trees |
scientific article; zbMATH DE number 4141472 |
Statements
Analysis of the standard deletion algorithms in exact fit domain binary search trees (English)
0 references
1990
0 references
data structure
0 references
average case analysis
0 references
binary search tree
0 references
0 references
0.8473256826400757
0 references
0.8399525284767151
0 references
0.8207765817642212
0 references
0.8162230253219604
0 references
0.8118946552276611
0 references
