# 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} }

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

## Probabilistic analysis of algorithms , stochastic fixed-point equations and ideal metrics

VIEW 1 EXCERPT

CITES METHODS

## 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

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

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

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

VIEW 5 EXCERPTS

## One-sided variations on interval trees

VIEW 3 EXCERPTS

## On the contraction method with degenerate limit equation

VIEW 3 EXCERPTS

## DISTRIBUTION OF DISTANCES IN RANDOM BINARY SEARCH TREES

VIEW 1 EXCERPT

## On the contraction method with degenerate limit equation

VIEW 3 EXCERPTS

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

VIEW 1 EXCERPT