Practice
Learn
← Quit
0 / 0 correct
Data Structures
Hard
1 of 40
What does a Fenwick tree (binary indexed tree) support, and why is it popular?
A
Graph traversal
B
Range minimum with O(1) queries
C
Prefix sums with point updates in O(log n), using a single array and simple bit tricks (i & -i)
D
Sorting