k-protected vertices in binary search trees
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.