"A note on the height of binary search trees."

Luc Devroye (1986)

> Home

Details and statistics

DOI: 10.1145/5925.5930

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/Devroye86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/Devroye86
Luc Devroye:
A note on the height of binary search trees. J. ACM 33(3): 489-498 (1986)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.