A storage scheme for hierarchic structures

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.