Intermediate
Data Structures & Algorithms
Q59 / 100
What is a Fenwick tree (Binary Indexed Tree)?
Correct! Well done.
Incorrect.
The correct answer is B) A compact data structure for prefix sum queries and point updates in O(log n)
B
Correct Answer
A compact data structure for prefix sum queries and point updates in O(log n)
Explanation
A Fenwick tree uses the lowest set bit of an index to determine responsibility ranges, enabling O(log n) prefix sums and updates with minimal code and memory.
Progress
59/100