Patterns in Random Binary Search

@inproceedings{FLAJOLET1996PatternsIR,
  title={Patterns in Random Binary Search},
  author={BinarySearch TreesPhilippe FLAJOLET and Xavier Gourdon and Conrado Mart{\'i}nez},
  year={1996}
}
In a randomly grown binary search tree (BST) of size n, any xed pattern occurs with a frequency that is on average proportional to n. Deviations from the average case are highly unlikely and well quantiied by a Gaussian law. Trees with forbidden patterns occur with an exponentially small probability that is characterized in terms of Bessel functions. The results obtained extend to BSTs a type of property otherwise known for strings and combinatorial tree models. They apply to paged trees or to… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 38 references

On the distribution of binary search trees under the random permutation model

Random Struct. Algorithms • 1996
View 4 Excerpts
Highly Influenced

Limit Laws for Local Counters in Random Binary Search Tree

Random Struct. Algorithms • 1991
View 9 Excerpts
Highly Influenced

Th eor emes limites pour les structures combinatoires et les fonc- tions arithmetiques

Hwang, H.-K
PhD thesis, Ecole Polytechnique, • 1994
View 9 Excerpts
Highly Influenced

An Introduction to Probability

W. Feller
Theory and Its Applications, • 1971
View 5 Excerpts
Highly Influenced

Systems of functional equations

Random Struct. Algorithms • 1997

Randomized search trees

Algorithmica • 1996
View 1 Excerpt

Similar Papers

Loading similar papers…