Distances and Finger Search in Random Binary Search Trees
From MaRDI portal
Publication:4651486
DOI10.1137/S0097539703424521zbMath1082.68023MaRDI QIDQ4651486
Ralph Neininger, Luc P. Devroye
Publication date: 21 February 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
68W40: Analysis of algorithms
68P10: Searching and sorting
60C05: Combinatorial probability
68P05: Data structures
Related Items
Retracted: Strong limiting behavior in binary search trees, The analysis of range quickselect and related problems, Distances in random digital search trees, The left-right-imbalance of binary search trees, On the distribution of distances between specified nodes in increasing trees, Limit laws for the Randić index of random binary tree models, Mixed Poisson approximation of node depth distributions in random binary search trees, Limiting theorems for the nodes in binary search trees, Limit Theorems for Depths and Distances in Weighted Random B-Ary Recursive Trees, EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES