On the subtree size profile of binary search trees (Q4933600)
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: On the subtree size profile of binary search trees |
scientific article; zbMATH DE number 5799574
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the subtree size profile of binary search trees |
scientific article; zbMATH DE number 5799574 |
Statements
On the Subtree Size Profile of Binary Search trees (English)
0 references
14 October 2010
0 references
random trees
0 references
binary search tree algorithm
0 references
tree sequence
0 references
0 references
0 references
0.8811061382293701
0 references
0.8678362965583801
0 references
0.8457472324371338
0 references
0.8333953619003296
0 references
0.8327555060386658
0 references
