A note on the path length of red-black trees (Q1198079)
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 92131
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the path length of red-black trees |
scientific article; zbMATH DE number 92131 |
Statements
A note on the path length of red-black trees (English)
0 references
16 January 1993
0 references
analysis of algorithms
0 references
data structures
0 references
upper bound
0 references
internal path length of a red-black tree
0 references
symmetric binary \(B\)-tree
0 references
half-balanced binary tree
0 references
asymptotic tightness
0 references
0.8489199280738831
0 references
0.8326358795166016
0 references
0.825484573841095
0 references
0.7986317276954651
0 references
0.7963513731956482
0 references
