Groups
Category
Level
An Euler Tour Tree represents each rooted tree as a DFS open/close sequence so that every subtree is a single contiguous interval.
A suffix array stores the starting indices of all suffixes of a string in lexicographic order.
A Link-Cut Tree (LCT) maintains a dynamic forest and supports link, cut, and path queries in O(log n) amortized time.
Centroid decomposition splits a tree into levels by repeatedly removing a centroid so that each remaining component is at most half the size.
Centroid decomposition splits a tree around a special node (centroid) so that every remaining component has at most half the nodes.
Heavy-Light Decomposition (HLD) breaks a tree into a small number of vertical chains so any path (u,v) becomes O(log n) contiguous segments in an array.
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.
Heavy-Light Decomposition (HLD) breaks a tree into O(n) disjoint chains so that any root-to-node path crosses only O(log n) chains.
Persistence lets you keep every past version of a data structure while making O(log n) updates and queries on any version.
A splay tree is a self-adjusting binary search tree that moves the most recently accessed node to the root with rotations.
An implicit treap is a randomized balanced binary tree that treats array positions as keys without storing them explicitly.
A persistent segment tree stores every historical version of an array-like data while supporting queries and updates in O(log n) time.