A NOTE ON THE EXPECTED BEHAVIOR OF BINARY-TREE TRAVERSALS

被引：1

作者：

ANDERSSON, A

机构：

[1] Lund Univ, Lund

来源：

COMPUTER JOURNAL | 1990年 / 33卷 / 05期

关键词：

D O I：

10.1093/comjnl/33.5.471

中图分类号：

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

学科分类号：

0812 ;

摘要：

Brinck and Foo have analysed tree traversal algorithms using threads and stack. In this note we show that, contrary to the results in the two referred papers, a preorder traversal is performed faster with a stack than with threads, in terms of pointer assignments. Moreover, the preorder-stack traversal is faster than any of the other standard traversals analysed in Refs 1 and 2.

引用

页码：471 / 472

页数：2