Groups
Category
Level
std::set and std::map store elements in sorted order using a balanced binary search tree (typically a Red-Black Tree).
A priority queue returns the highest-priority element first and is efficiently implemented by a binary heap.