Groups
Category
Centroid decomposition splits a tree around a special node (centroid) so that every remaining component has at most half the nodes.
A monotonic deque is a double-ended queue that keeps elements in increasing or decreasing order so that the front always holds the current optimum (min or max).