Summary
The theory of records in sequences of independent identically distributed random variables leads to simple proofs of various properties of random trees, including among other things, the limit law for the depth of the last node of random ordered trees, random union-find trees, and random binary search trees.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Reading Mass.: Addison-Wesley 1975.
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data structures and algorithms. Reading, Mass.: Addison-Wesley 1983.
Brown, G.G., Shubert, B.O.: On random binary trees. Math. Oper. Res..9, 43–65 (1984).
Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statist..23, 493–507 (1952).
Chow, Y.S., Teicher, H.: Probability theory. Berlin Heidelberg New York: Springer 1978
Devroye, L.: A note on the height of binary search trees. J. ACM33, 489–498 (1986).
Devroye, L.: Branching processes in the analysis of the heights of trees. Acta Informatica24, 277–298 (1987)
Doyle, J., Rivest, R.L.: Linear expected time of a simple union-find algorithm. Inform. Proc. Lett.5, 146–148 (1976).
Glick N.: Breaking records and breaking boards. Am. Math. Monthly.85, 2–26 (1978)
Hofri, M.: Probabilistic analysis of algorithms Berlin Heidelberg New York: Springer 1987.
Knuth, D.E.: The art of computer programming. Vol. 3: Sorting and searching. Reading, Mass.: Addison-Wesley 1973
Knuth, D.E.: The art of computer programming. Vol. 1: Fundamental algorithms. 2nd Edn. Reading, Mass.: Addison-Wesley 1973.
Knuth, D.E., Schonhage, A.: The expected linearity of a simple equivalence algorithm. Theor. Comput. Sci..6, 281–315 (1978).
Lynch, W.C.: More combinatorial problems on certain trees. Comput. J..7, 299–302 (1965)
Mahmoud, H., Pittel, B.: On the most probable shape of a search tree grown from a random permutation. SIAM J. Algebr. Discr. Methods5, 69–81 (1984)
Pittel, B.: On growing random binary trees. J. Math. Anal. Appl..103, 461–480 (1984)
Renyi, A.: Theorie des elements saillant d’une suite d’observations. In: Colloquium on combinatorial methods in probability theory, pp. 104–115. Aarhus Universitet, Denmark: Mathematisk Institut 1962.
Robson, J.M.: The height of binary search trees. Austr. Comput. J..11, 151–153 (1979)
Sedgewick, R.: Mathematical analysis of combinatorial algorithms. In: Louchard, G., Latouche, G. (eds.), Probability Theory and Computer Science pp. 123–205 London: Academic Press 1983
Yao, A.C.: On the average behavior of set merging algorithms (extended abstract). In: Proceedings of the Eighth Annual Symposium on Theory of Computing, pp. 192–195 (1976).
Author information
Authors and Affiliations
Additional information
Research of the author was sponsored by NSERC Grant A 3456 and by FCAC Grant EQ-1678
Rights and permissions
About this article
Cite this article
Devroye, L. Applications of the theory of records in the study of random trees. Acta Informatica 26, 123–130 (1988). https://doi.org/10.1007/BF02915448
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02915448