Range Mode and Range Median Queries on Lists and Trees
<|reference_start|>Range Mode and Range Median Queries on Lists and Trees: We consider algorithms for preprocessing labelled lists and trees so that, for any two nodes u and v we can answer queries of the form: What is the mode or median label in the sequence of labels on the path from u to v.<|reference_end|>
@article{krizanc2003range,
    title={Range Mode and Range Median Queries on Lists and Trees},
    author={Danny Krizanc, Pat Morin and Michiel Smid},
    journal={arXiv preprint arXiv:cs/0307034},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0307034},
    primaryClass={cs.DS}
}