Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations (Q3529509)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations |
scientific article |
Statements
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations (English)
0 references
13 October 2008
0 references
number of subtrees
0 references
random recursive trees
0 references
random binary search tree
0 references
limit law
0 references
Berry-Esseen bounds
0 references
Poisson approximation
0 references
0 references
0 references
