About this question
Hard · Algorithms & Data Structures · Quant Trader interview question · fenwick-tree, binary-indexed-tree, prefix-sum, data-structures, algorithms
You are developing a high-frequency trading algorithm that relies on rapidly querying and updating order book data. You need to maintain a cumulative sum of order sizes at various price levels. You are considering using either a Fenwick Tree (Binary Indexed Tree) or a standard prefix sum array. Given the need for both frequent updates to individual order sizes and frequent queries for cumulative order sizes, what primary advantage does a Fenwick Tree offer over a prefix sum array in this scenari