On a random search tree: asymptotic enumeration of vertices by distance from leaves (Q5233192)
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 7105422
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a random search tree: asymptotic enumeration of vertices by distance from leaves |
scientific article; zbMATH DE number 7105422 |
Statements
On a random search tree: asymptotic enumeration of vertices by distance from leaves (English)
0 references
16 September 2019
0 references
search tree
0 references
root
0 references
leaves
0 references
rank
0 references
enumeration
0 references
asymptotic
0 references
distribution
0 references
numerical data
0 references
0 references
0.8147489428520203
0 references
0.8147236704826355
0 references
0.7967835068702698
0 references
0.777495265007019
0 references
0.7747799158096313
0 references
