Abstract

We show that for every k, the probability that a randomly selected vertex of a random binary search tree on n nodes is at distance k−1 from the closest leaf converges to a rational constant ck as n goes to infinity.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call