Binary Indexed Tree(BIT) also known as Fenwick Tree is a tree based advanced data structure that can be used to store and calculate cumulative sum or frequency. BIT is more efficient than other data structures (like Segment Tree and other RMQ) considering the time complexity, memory complexity and Line of Code.
