One-sided variations on binary search trees

@article{Mahmoud2003OnesidedVO,
  title={One-sided variations on binary search trees},
  author={Hosam M. Mahmoud},
  journal={Annals of the Institute of Statistical Mathematics},
  year={2003},
  volume={55},
  pages={885-900}
}
  • Hosam M. Mahmoud
  • Published 2003
  • Mathematics
  • Annals of the Institute of Statistical Mathematics
  • We investigate incomplete one-sided variants of binary search trees. The (normed) size of each variant is studied, and convergence to a Gaussian law is proved in each case by asymptotically solving recurrences. These variations are also discussed within the scope of the contraction method with degenerate limit equations. In an incomplete tree the size determines most other parameters of interest, such as the height and the internal path length. 

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-5 OF 5 CITATIONS

    The climbing depth of random trees

    VIEW 5 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Paths in m-ary interval trees

    VIEW 4 EXCERPTS
    CITES BACKGROUND

    ANALYSIS OF SOME TREE STATISTICS

    VIEW 3 EXCERPTS
    CITES METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 22 REFERENCES

    Applications of the theory of records in the study of random trees

    • Luc Devroye
    • Mathematics, Computer Science
    • Acta Informatica
    • 2008
    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Cutting a random tree (and UNION-FIND algorithms) (manuscript)

    • P. Chassaing, R. Marchand
    • 2002
    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    On a multivariate contraction method for random recursive structures with applications to Quicksort

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Evolution of random search trees

    • Hosam M. Mahmoud
    • Mathematics, Computer Science
    • Wiley-Interscience series in discrete mathematics and optimization
    • 1991
    VIEW 5 EXCERPTS

    On the contraction method with degenerate limit equation

    • R. Neininger, L. Riischendorf
    • 2002
    VIEW 3 EXCERPTS

    The random bisection problem and the distribution of the height of binary search trees (manuscript)

    • M. Drmota
    • 2002
    VIEW 1 EXCERPT