1. Kemp R: Fundamentals of the Average Case Analysis of Particular Algorithms. Wiley-Teubner, Stuttgart; 1984.
2. Knuth D 3. In The Art of Computer Programming: Sorting and Searching. Addison-Wesley, Reading; 1973.
3. Mahmoud H: Evolution of Random Search Trees. Wiley, New York; 1992.
4. Sedgewick R, Flajolet P: An Introduction to the Analysis of Algorithms. Addison-Wesley, Reading; 1996.
5. Kirschenhofer P: On the height of leaves in binary trees. J. Comb. Inf. Syst. Sci. 1983, 8: 44–60.