Acta Informatica

, Volume 9, Issue 2, pp 159–170 | Cite as

On random 2–3 trees

  • Andrew Chi-Chih Yao


It is shown that ¯n (N), the average number of nodes in an N-key random 2–3 tree, satisfies the inequality 0.70 N < ¯n(N) <0.79 N for large N. A similar analysis is done for general B-trees. It is shown that storage utilization is essentially ln 2≈69% for B-tree of high orders.


Information System Operating System Data Structure Communication Network Information Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Reading (Mass.): Addison-Wesley 1974Google Scholar
  2. 2.
    Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes. Acta Informat. 1, 173–189 (1972)Google Scholar
  3. 3.
    Chvatal, V., Klarner, D.A., Knuth, D.E.: Selected combinatorial research problems. Computer Science Dept., Stanford University, Problem 37, STAN-CS-72-292, 1972Google Scholar
  4. 4.
    Knuth, D.E.: The art of computer programming, Vol. 1, Fundamental algorithms. Reading (Mass.): Addison-Wesley 1968Google Scholar
  5. 5.
    Knuth, D.E.: The art of computer programming, Vol. 3, Sorting and searching. Reading (Mass.): Addison-Wesley 1973Google Scholar
  6. 6.
    Yao, A. C.: On random 3-2 trees. Department of Computer Science, University of Illinois, Technical Report (74-679), October 1974Google Scholar

Copyright information

© Springer-Verlag 1978

Authors and Affiliations

  • Andrew Chi-Chih Yao
    • 1
  1. 1.Computer Science DepartmentStanford UniversityStanfordUSA

Personalised recommendations