We give a succinct data-structure that stores a tree with colors on the nodes. Given a node x and a color alpha, the structure finds the nearest node to x with color alpha. This results improves the O(nlogn)-bits structure of Gawrychowski et al.~[CPM 2016].
Cite
@article{arxiv.1609.01400,
title = {Succinct data-structure for nearest colored node in a tree},
author = {Dekel Tsur},
journal= {arXiv preprint arXiv:1609.01400},
year = {2017}
}