Distances and Finger Search in Random Binary Search Trees

Authors:
Luc Devroye;Ralph Neininger
Affiliations:
-;-
Venue:
SIAM Journal on Computing
Year:
2004

Citing 0
Cited 5

Extremal Weighted Path Lengths In Random Binary Search Trees

Probability in the Engineering and Informational Sciences
The left-right-imbalance of binary search trees

Theoretical Computer Science
On Weighted Path Lengths And Distances In Increasing Trees

Probability in the Engineering and Informational Sciences
On the distribution of distances between specified nodes in increasing trees

Discrete Applied Mathematics
The analysis of Range Quickselect and related problems

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the random binary search tree with n nodes inserted the number of ancestors of the elements with ranks k and $\ell$, $1 \le k