Binary search trees constructed from nondistinct keys with/without specified probabilities

Theoretical Computer Science

Volumn 156, Issue 1-2, 1996, Pages 39-70

  Kemp, Rainer ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; FINITE ELEMENT METHOD; MATHEMATICAL MODELS; PASCAL (PROGRAMMING LANGUAGE); PROBABILITY;

BINARY SEARCH TREES; CLOSED FORM EXPRESSIONS; NONDISTINCT KEYS;

DATA STRUCTURES;

EID: 0030109035     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00302-9     Document Type: Article

References (10)

1. M. Abramowitz and A. Stegun, Handbook of Mathematical Functions (Dover, New York, 1970).
2. S.R. Arora and W.T. Dent, Randomized binary search techniques, Comm. ACM 12 (1969) 77-80.
3. W.H. Burge, An analysis of binary search trees formed from sequences of nondistinct keys, J. ACM 23 (1976) 451-454.
4. L. Comtet, Advanced Combinatorics (D. Reidel, Dordrecht, 1974).
5. P. Flajolet and A.M. Odlyzko, Singularity analysis of generating functions, SIAM J. Discrete Math. 3(2) (1990) 216-240.
6. P. Kirschenhofer, On the height of leaves in bianry trees, J. Combin. Inform. System Sci. 8(1) (1983) 44-60.
7. D.E. Knuth, The Art of Computer Programming. Vol. 1 (Addison-Wesley, Reading, MA, 2nd ed., 1973).
8. D.E. Knuth, The Art of Computer Programming, Vol. 3 (Addison-Wesley, Reading, MA, 2nd ed., 1975).
9. H. Prodinger, Combinatorics of geometrically distributed random variables: Left-to-right maxima, preprint TU Vienna, 1993 (also presented at: 5th FPSAC, Firenze, 1993); to appear in Discrete Math.
10. W. Szpankowski and V. Rego, Yet another application of a binomial recurrence: Order statistics, Computing 43 (1990) 401-410.