A BOUNDED-SPACE TREE TRAVERSAL ALGORITHM

Authors
HIRSCHBERG DS SEIDEN SS
Citation
Ds. Hirschberg et Ss. Seiden, A BOUNDED-SPACE TREE TRAVERSAL ALGORITHM, Information processing letters, 47(4), 1993, pp. 215-219
Citations number
13
Categorie Soggetti
Information Science & Library Science","Computer Applications & Cybernetics
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
47
Issue
4
Year of publication
1993
Pages
215 - 219
Database
ISI
SICI code
0020-0190(1993)47:4<215:ABTTA>2.0.ZU;2-E
Abstract
An algorithm for traversing binary trees in linear time using constant extra space is presented. The algorithm offers advantages to both Rob son traversal and Lindstrom scanning. Under certain conditions, the al gorithm can be applied to the marking of cyclic list structures. The a lgorithm can be generalized to handle N-trees and N-lists.