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
Fenwick Tree - Range Update Range Query
A Fenwick Tree (Binary Indexed Tree) can support range additions and range sum queries by maintaining two trees, often called B1 and B2.
#fenwick tree#binary indexed tree#range add+12