The Expected Performance of Traversal Algorithms in Binary Trees

descriptionPublicationkeyboard_double_arrow_right Article 01 Apr 1985 English Publisher:Oxford University Press (OUP)Journal:The Computer Journal, volume 28, pages 426-432 (issn: 0010-4620, eissn: 1460-2067,

Copyright policy )

Authors: Keith Brinck;

doi: 10.1093/comjnl/28.4.426

The Expected Performance of Traversal Algorithms in Binary Trees

- Summary
- Subjects
- Metrics

Abstract

The paper compares expected performance measures for common traversal algorithms operating on threaded and unthreaded binary trees, under the assumption that the trees are selected from the distribution induced by random insertions. The results are shown to be similar to those derived in an earlier paper for binary trees selected from the uniform distribution.

Related Organizations

University of Iowa
United States

Keywords

data structures, Data structures, Graph theory (including graph drawing) 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).	7
	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.	Average
	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 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average