Description: Many improved versions of binary indexed tree. Which can be used to do these kinds of work in a 1D array:
Change one point+k and get the prefixsum
Change a range+k and get value of one point
Change a range+k and get the prefixsum
RMQ(Range max/minimum question)
An offline balanced tree
2D extend and 2+D is similar
To Search:
File list (Check if you may need any files):
Binary Inddexed Tree.cpp
Download