Groups
A wavelet tree is a recursive data structure built over a sequenceโs alphabet that answers rank, select, and quantile (k-th smallest) queries in O(log ฯ) time, where ฯ is the number of distinct values.
Persistence lets you keep every past version of a data structure while making O(log n) updates and queries on any version.