Journal article
A storage scheme for hierarchic structures
Abstract
The representation of a tree by a right-threaded binary tree, as described for example by Knuth (1968, pp. 332 ff), is extended to permit representation of ‘hierarchic structures’ (directed graphs without circuits). This representation corresponds to a compact storage scheme useful both for ascent and descent of the hierarchy.
Authors
Smyth W; Radaceanu E
Journal
The Computer Journal, Vol. 17, No. 2, pp. 152–156
Publisher
Oxford University Press (OUP)
Publication Date
February 1, 1974
DOI
10.1093/comjnl/17.2.152
ISSN
0010-4620