Question
A programmer needs prefix sums with updates, and the chosen structure has the property that index movement is based on the least significant set bit. Which choice fits best?
Select an option. Your answer will be checked instantly.
Correct Answer: D. Fenwick Tree
Explanation:
Fenwick Tree fits because it supports prefix sums with updates and index movement is based on the least significant set bit.
Both clues point to this choice.
Leave a Reply