Succinct data structure for dynamic trees with faster queries

Research output: Contribution to journalArticlepeer-review


Navarro and Sadakane [19] gave a dynamic succinct data structure for storing an ordinal tree. The structure supports tree queries in either O(log⁡n/log⁡log⁡n) or O(log⁡n) time, and insertion or deletion of a single node in O(log⁡n) time. In this paper we improve the result of Navarro and Sadakane by reducing the time complexities of some queries (e.g. degree and level_ancestor) from O(log⁡n) to O(log⁡n/log⁡log⁡n).

Original languageAmerican English
Pages (from-to)12-19
Number of pages8
JournalTheoretical Computer Science
StatePublished - 9 Aug 2019


  • Ordinal trees
  • Succinct data structures

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Succinct data structure for dynamic trees with faster queries'. Together they form a unique fingerprint.

Cite this