Succinct data structures for nearest colored node in a tree

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].