k-Protected vertices in binary search trees

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.