Concepts5

Constructive algorithms build a valid answer directly by following a recipe, rather than searching exhaustively.

Tree isomorphism asks whether two trees have exactly the same shape, ignoring vertex names.

Centroid decomposition splits a tree into levels by repeatedly removing a centroid so that each remaining component is at most half the size.

A binary trie (also called a bitwise trie) stores numbers by their binary bits, branching on 0/1 at each level.

std::set and std::map store elements in sorted order using a balanced binary search tree (typically a Red-Black Tree).