Please use this identifier to cite or link to this item: http://hdl.handle.net/1880/45807
Title: A FAST COMPACT REPRESENTATION OF TREES USING HASH TABLES
Authors: Cleary, John G.
Darragh, John J.
Keywords: Computer Science
Issue Date: 1-Sep-1984
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.
URI: http://hdl.handle.net/1880/45807
Appears in Collections:Cleary, John

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.