Groups
Category
A binary trie (also called a bitwise trie) stores numbers by their binary bits, branching on 0/1 at each level.
A Fenwick Tree (Binary Indexed Tree) can support range additions and range sum queries by maintaining two trees, often called B1 and B2.