Learn More
An <i>ordinal tree</i> is an arbitrary rooted tree where the children of each node are ordered. Succinct representations for ordinal trees with efficient query support have been extensively studied. The best previously known result is due to Geary et al. [2004b, pages 1--10]. The number of bits required by their representation for an <i>n</i>-node ordinal(More)
  • 1