On random 2?3 trees

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 1978 English Publisher:Springer Science and Business Media LLCJournal:Acta Informatica, volume 9, pages 159-170 (issn: 0001-5903, eissn: 1432-0525,

Copyright policy )

Authors: Andrew Chi-Chih Yao;

doi: 10.1007/bf00289075

On random 2?3 trees

- Summary
- Subjects
- Metrics

Abstract

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.

Related Organizations

Stanford University
United States

Keywords

Combinatorial probability, Algorithms in computer science, Trees

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	140
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 0.1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%