Onno J. Boxma, Alan G. Konheim
Acta Informatica
The class ⊤ of binary search trees is studied. A leaf is a vertex of degree 0; ⊤n is the subset of ⊤ consisting of trees with n leaves. We grow trees in ⊤n from ⊤n - 1 thereby inducing a probability measure on ⊤n. We will show that the expected value of the average leaf distance of t ∈ ⊤n is asymptotic to log2n as n → ∞. © 1973.
Onno J. Boxma, Alan G. Konheim
Acta Informatica
Alan G. Konheim, Martin Reiser
Journal of the ACM
Alan G. Konheim
IEEE Transactions on Communications
Date J. W. Noorlag, Lewis M. Terman, et al.
IEEE Journal of Solid-State Circuits