Average depth in a binary search tree with repeated keys (Q3575002)
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: Average depth in a binary search tree with repeated keys |
scientific article; zbMATH DE number 5730487
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average depth in a binary search tree with repeated keys |
scientific article; zbMATH DE number 5730487 |
Statements
5 July 2010
0 references
binary search trees
0 references
average case analysis
0 references
repeated keys
0 references
multiset
0 references
shuffle product
0 references
0.8062350749969482
0 references
0.8062350749969482
0 references
0.7969935536384583
0 references
0.7619866132736206
0 references
