Let's test your knowledge. Fill in the missing part by typing it in.

A Fenwick Tree, also known as a Binary Indexed Tree (BIT), is a data structure that allows efficient calculation of prefix sums of an array, as well as updates to individual array elements. It is primarily used to solve problems involving cumulative frequency or cumulative sum calculations.

The Fenwick Tree is particularly useful when we need to perform ___ queries (such as finding the sum of elements in a given range) and update individual elements in an array efficiently.