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
Description
Keywords
Computer Science