Martingales and Profile of Binary Search Trees

B. Chauvin, Thierry Klein, Jean‐François Marckert, Alain Rouault

Electronic Journal of Probability · 2005 · 49 citations · 31 references

DOIFull text

Open access

Concepts

Abstract

We are interested in the asymptotic analysis of the binary search tree (BST) under the random permutation model. Via an embedding in a continuous time model, we get new results, in particular the asymptotic behavior of the profile.

References

31