THE EXPECTED PERFORMANCE OF TRAVERSAL ALGORITHMS IN BINARY-TREES

被引：8

作者：

BRINCK, K

机构：

[1] Univ of Iowa, Dep of Computer, Science, Iowa City, IA, USA, Univ of Iowa, Dep of Computer Science, Iowa City, IA, USA

来源：

COMPUTER JOURNAL | 1985年 / 28卷 / 04期

关键词：

DATA PROCESSING - Data Structures - MATHEMATICAL TECHNIQUES - Trees;

D O I：

10.1093/comjnl/28.4.426

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：426 / 432

页数：7