Binary Indexed Tree (BIT) Binary Indexed Tree makes it possible to implement the following queries with O(log N). To calculate sum of values in range To update the value of index Basic idea This structure is Binary Tree like Segment Tree. But BIT is much easier to code, and require less memory spac…
