Random binary trees. Algorithms, asymptotics and statistics (Q2900747)
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: Random binary trees. Algorithms, asymptotics and statistics |
scientific article; zbMATH DE number 6059722
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Random binary trees. Algorithms, asymptotics and statistics |
scientific article; zbMATH DE number 6059722 |
Statements
25 July 2012
0 references
convergence in distribution
0 references
subtree size profile
0 references
contraction method
0 references
binary trees
0 references
binary search trees
0 references
digital search trees
0 references
asymptotic behaviour of pathlength
0 references
statistical methods
0 references
subtree cumulation
0 references
iceberg
0 references
distribution families
0 references
random recursive trees
0 references
Random binary trees. Algorithms, asymptotics and statistics (English)
0 references
0.8699997067451477
0 references
0.8678362965583801
0 references
0.860213577747345
0 references
0.8308325409889221
0 references
0.8200923204421997
0 references
