A FAST COMPACT REPRESENTATION OF TREES USING HASH TABLES
Date
1984-09-01
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
A new representation of trees using hash tables is described. Like the
usual pointer representation leaves can be reached or inserted in a time
proportional to the depth of the tree. Each node uses only the space for
its data plus an overhead of $10~+~left ceiling {log sub 2 n} right ceiling$
bits, where $n$ is the number of children allowed on each node. A parent
node is accessible from its child, allowing an algorithm to be
exhibited for traversing a tree using a small constant amount of storage
and without modifying the tree itself. Expressions are given for the space
and time required for traversal of trees, as well as, space and timing
data from an actual implementation.
Description
Keywords
Computer Science