$k$-protected vertices in binary search trees

Miklos Bona

Published 2013-04-22Version 1

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 $c_k$ as $n$ goes to infinity.