Concepts2
🗂️Data StructureIntermediate
Binary Trie for XOR
A binary trie (also called a bitwise trie) stores numbers by their binary bits, branching on 0/1 at each level.
#binary trie#bitwise trie#xor+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