Try this exercise. Fill in the missing part by typing it in.

A Fenwick Tree is a data structure that efficiently supports prefix sum queries. It is also known as a Binary Indexed Tree or BIT. The main motivation behind Fenwick Trees is to reduce the time complexity of range sum queries. It achieves this by representing an array of numbers with a binary tree-like data structure. Each node in the tree stores the sum of a range of elements in the original array. The leaf nodes correspond to individual elements in the array. The internal nodes represent the cumulative sums of certain ranges of elements. To calculate the prefix sum of a given index, we navigate the tree from the leaf node to the root, adding up the values along the way. Fenwick Trees have a space complexity of O(n) and can be constructed in O(nlogn) time, where n is the size of the input array. Fill in the blank: A Fenwick Tree is a data structure that efficiently supports __ queries.