On Weighted Depths in Random Binary Search Trees
Crossref DOI link: https://doi.org/10.1007/s10959-017-0773-1
Published Online: 2017-07-11
Published Print: 2018-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Aguech, Rafik
Amri, Anis
Sulzbach, Henning
Funding for this research was provided by:
University of Birmingham
Text and Data Mining valid from 2017-07-11