Fenwick Tree or Binary Indexed Tree

What kind of problems are commonly solved via Fenwick Tree of Binary Indexed Tree:

• efficient prefix sums
• sum range queries
• implement the arithmetic coding algorithm
• count inversions in an array

Java Implementations for Fenwick Tree (Binary Indexed Tree)

• No Java default implementation
• Implementation supporting point update example