1. B. Chauvin, M. Drmota, and J. Jabbour-Hattab.The profile of binary search trees. Ann. Appl. Prob., 11:1042–1062, 2001.
2. B. Chauvin, T. Klein, J.F. Marckert, and A. Rouault. Martingales, Embedding and Tilting of Binary Trees. Preprint available at
http://fermat.math.uvsq.fr/marckert/papers.html
2003
3. B.Chauvin and N.Pouyanne.,m-ary search trees when m >26: a strong asymptotics for the space requirements, to appear in Random Structures and Algorithm 2004.Preprint available at
http://fermat.math.uvsq.fr/~chauvin
4. F. M. Dekking, S. De Graaf, and L. E. Meester. On the node structure of binary search trees. Trends in Mathematics. Birkhäuser Verlag, Basel, pages 31–40, 2000.
5. F. M Dekking and L. E. Meester. An almost sure result for path lengths in binary search trees. Adv. Appl. Prob., 35:363–376, 2003.