Fenwick Tree (BIT): Prefix Sums on the Cheap
Implement and understand the Fenwick tree, also called the binary indexed tree, for O(log n) prefix sums and point updates in just a few lines.
·6 min read · #data-structures#fenwick-tree#intermediate
#data-structures
2 posts.
Segment Tree: Range Queries and Updates
Learn segment trees for fast range sum, min, and max queries with point updates, including a clean iterative Python implementation.
·6 min read · #data-structures#segment-tree#intermediate