Groups
A treap is a binary search tree on keys combined with a heap on random priorities, which keeps the tree balanced in expectation.
Segment Tree Beats is a segment tree variant that supports range chmin/chmax (clamping) together with queries like range sum, min, and max in amortized logarithmic time.