An almost sure result for path lengths in binary search trees

Journal article (2003)

Authors

F.M. Dekking Applied Probability - EEMCS
L.E. Meester Applied Probability - EEMCS
Research Group
Applied Probability (EEMCS) (TU Delft)
More Info
expand_more

Published Date

2003

Language

Undefined/Unknown

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Delft Institute of Applied Mathematics

Research Group

Applied Probability