Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
We implement and compare the major current techniques for representing general trees in succinct form. This is important because a general tree of n nodes is usually represented i...
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...