Fenwick Trees (or) Binary Indexed Trees # Use cases # Prefix sum of arrays Complexity # Space - O(N) Operation Complexity Create O(N * log N) Update O(log N)