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
Trie (Prefix Tree)
A trie (prefix tree) stores strings or bit-sequences so that common prefixes share nodes, making operations depend on the key length L rather than the set size.
#trie#prefix tree#autocomplete+12