Concepts2
🗂️Data StructureIntermediate
Ordered Set and Map
std::set and std::map store elements in sorted order using a balanced binary search tree (typically a Red-Black Tree).
#ordered set#ordered map#std::set+12
🗂️Data StructureIntermediate
Priority Queue (Heap)
A priority queue returns the highest-priority element first and is efficiently implemented by a binary heap.
#priority queue#binary heap#min-heap+11