Key points are not available for this paper at this time.
We study the average height of random trees generated by leaf-centric binary tree sources as introduced by Zhang, Yang and Kieffer. A leaf-centric binary tree source induces for every n 2 a probability distribution on the set of binary trees with n leaves. Our results generalize a result by Devroye, according to which the average height of a random binary search tree of size n is in O (n).
Louisa Seelbach Benkner (Tue,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: