English

String Trees

Data Structures and Algorithms 2015-03-20 v1

Abstract

A string-like compact data structure for unlabelled rooted trees is given using 2n bits.

Keywords

Cite

@article{arxiv.1204.4765,
  title  = {String Trees},
  author = {Julius D'souza},
  journal= {arXiv preprint arXiv:1204.4765},
  year   = {2015}
}

Comments

5 pages

R2 v1 2026-06-21T20:52:53.966Z