Succinct data structures for nearest colored node in a tree

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


We give succinct data structures that store a tree with colors on the nodes. Given a node x and a color α the structures find the nearest node to x with color α. Our results improve the O(nlog⁡n)-bits structure of Gawrychowski et al. (2016) [12].

Original languageEnglish
Pages (from-to)6-10
Number of pages5
JournalInformation Processing Letters
StatePublished - 1 Apr 2018


  • Colored trees
  • Labeled trees
  • Succinct data structures

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'Succinct data structures for nearest colored node in a tree'. Together they form a unique fingerprint.

Cite this