A tight upper bound for the path length of AVL trees (Q912600)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4145307
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight upper bound for the path length of AVL trees |
scientific article; zbMATH DE number 4145307 |
Statements
A tight upper bound for the path length of AVL trees (English)
0 references
1990
0 references
See the review in Zbl 0645.68076.
0 references
node visit cost
0 references
binary tree
0 references
Adel'son-Vel'skij-Landis tree
0 references
path length
0 references
AVL trees
0 references
comparison cost
0 references
brother trees
0 references
