Concepts3
🗂️Data StructureIntermediate
Merge Sort Tree
A Merge Sort Tree is a segment tree where every node stores the sorted list of values in its segment.
#merge sort tree#segment tree#range query+12
🗂️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 StructureBeginner
Array and Vector
Arrays and vectors store elements contiguously, giving O(1) random access via index.
#std::vector#dynamic array#reserve+12