Skip to main content Accessibility help
×
×
Home

Multiway Trees of Maximum and Minimum Probability under the Random Permutation Model

  • Robert P. Dobrow (a1) and James Allen Fill (a2)

Abstract

Multiway trees, also known as m–ary search trees, are data structures generalising binary search trees. A common probability model for analysing the behaviour of these structures is the random permutation model. The probability mass function Q on the set of m–ary search trees under the random permutation model is the distribution induced by sequentially inserting the records of a uniformly random permutation into an initially empty m–ary search tree. We study some basic properties of the functional Q, which serves as a measure of the ‘shape’ of the tree. In particular, we determine exact and asymptotic expressions for the maximum and minimum values of Q and identify and count the trees achieving those values.

Copyright

References

Hide All
[1]Knuth, D. (1973) The Artof Computer Programming, Vol. 1: Fundamental Algorithms, 2nd ed.Addison-Wesley, Reading, MA.
[2]Knuth, D. (1973). The Art of Computer Programming, Vol. 3: Sorting and Searching, 2nd ed.Addison-Wesley, Reading, MA.
[3]Mahmoud, H. (1992) Evolution of Random Search Trees. Wiley, New York.
[4]Muntz, R. and Uzgalis, R. (1971) Dynamic storage allocation for binary search trees in a two-level memory. Proceedings of Princeton Conference on Information Sciences and Systems, Vol. 4, 345349.
[5]Bayer, R. and McCreight, E. (1972) Organization and maintenance of large ordered indexes. Ada Inform. 1 173189.
[6]Mahmoud, H. and Pittel, B. (1989) Analysis of the space of search trees under the random insertion algorithm. J. Alg. 10 5275.
[7]Devroye, L. (1990) On the height of random m–ary search trees. Rand. Struct. Alg. 1 191203.
[8]Pittel, B. (1994) Note on the heights of random recursive trees and random w–ary search trees. Rand. Struct. Alg. 5 337347.
[9]Fill, J. A. and Dobrow, R. P. (1995) The number of w–ary search trees on n keys. Technical Report #543, Department of Mathematical Sciences, The Johns Hopkins University. Combinatorics, Probability & Computing (to appear.)
[10]Fill, J. A. (1996) On the distribution for binary search trees under the random permutation model. Rand. Struct. Alg. 8 125.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed