Discover the Fenwick Tree, or Binary Indexed Tree (BIT). Learn how it achieves O(log n) range sums with less memory and code than a Segment Tree.