Publications
4 shownA note on the height of binary search trees
Let H n be the height of a binary search tree with n nodes constructed by standard insertions from a random permutation of 1, … , n . It is shown that H n /log n → c = 4.31107 …...
Frequent Co-Authors
Researcher Info
- h-index
- 4
- Publications
- 4
- Citations
- 8,285
- Institution
- McGill University
External Links
Identifiers
- ORCID
- 0009-0001-4330-8991
Impact Metrics
h-index
4
h-index: Number of publications with at least h citations each.