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.
|Organisation||Computational Geometry Lab|
Krizanc, D. (Danny), Morin, P, & Smid, M. (2003). Range mode and range median queries on lists and trees.