Representing Trees of Higer Degree

  • Authors:

  • David Benoit;Erik D. Demaine;J. Ian Munro;Venkatesh Raman

  • Affiliations:

  • -;-;-;-

  • Venue:
  • WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper focuses on space efficient representations of trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, we turn our attention to trees of higher degree. We consider both cardinal trees (rooted trees where each node has k positions each of which may have a reference to a child) and ordinal trees (the children of each node are simply ordered). Our representations use a number of bits within a lower order term of the information theoretic lower bound. For cardinal trees the structure supports finding the parent, child i or subtree size of a given node. For ordinal trees we support the operations of finding the degree, parent, ith child and subtree size. These operations provide a mapping from the n nodes of the tree onto the integers [1, n] and all are performed in constant time, except finding child i in cardinal trees. For k-ary cardinal trees, this operation takes O(lg lg k) time for the worst relationship between k and n, and constant time if k is much less than n.