An almost sure result for path lengths in binary search trees (Q4449502): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q505046 |
||
| Property / author | |||
| Property / author: F. Michel Dekking / rank | |||
Revision as of 17:37, 15 February 2024
scientific article; zbMATH DE number 2040278
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An almost sure result for path lengths in binary search trees |
scientific article; zbMATH DE number 2040278 |
Statements
An almost sure result for path lengths in binary search trees (English)
0 references
11 February 2004
0 references
Binary search tree
0 references
random permutation model
0 references
path length
0 references
almost sure convergence
0 references
quicksort distribution
0 references
