Query costs in HB(1) trees versus 2?3 trees (Q3940859)
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: Query costs in HB(1) trees versus 2?3 trees |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Query costs in HB(1) trees versus 2?3 trees |
scientific article |
Statements
Query costs in HB(1) trees versus 2?3 trees (English)
0 references
1981
0 references
binary search trees
0 references
AVL trees
0 references
tree height
0 references
dense and sparse nodes
0 references
key comparison
0 references
node visit
0 references
