@article{Devroye_1986,
    doi = {10.1145/5925.5930},
    url = {https://doi.org/10.1145%2F5925.5930},
    year = {1986},
    month = {may},
    publisher = {Association for Computing Machinery ({ACM})},
    volume = {33},
    number = {3},
    pages = {489--498},
    author = {Luc Devroye},
    title = {A note on the height of binary search trees},
    journal = {Journal of the {ACM}}
}

@article{Devroye_1986, doi = {10.1145/5925.5930}, url = {https://doi.org/10.1145%2F5925.5930}, year = {1986}, month = {may}, publisher = {Association for Computing Machinery ({ACM})}, volume = {33}, number = {3}, pages = {489--498}, author = {Luc Devroye}, title = {A note on the height of binary search trees}, journal = {Journal of the {ACM}} }