Martingales and Profile of Binary Search Trees
classification
🧮 math.PR
keywords
asymptoticbinarymodelprofilesearchanalysisbehaviorcontinuous
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.