All MCQs

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.

The defining property is that index movement is based on the least significant set bit.
The other statements describe different structures or concepts.

Fenwick Tree is commonly used for prefix sums with updates.
Its design supports this task efficiently or naturally.

Fenwick Tree is an indexed tree that stores partial cumulative information in an array.
This description distinguishes it from the other choices.

Segment Tree fits because it supports range queries with point or range updates and a query can combine results from a logarithmic number of nodes.
Both clues point to this choice.

The defining property is that a query can combine results from a logarithmic number of nodes.
The other statements describe different structures or concepts.

Segment Tree is commonly used for range queries with point or range updates.
Its design supports this task efficiently or naturally.

Segment Tree is a binary tree structure storing aggregate information over intervals.
This description distinguishes it from the other choices.

Union by Rank fits because it supports keeping union-find trees short and rank approximates tree height.
Both clues point to this choice.

The defining property is that rank approximates tree height.
The other statements describe different structures or concepts.

Union by Rank is commonly used for keeping union-find trees short.
Its design supports this task efficiently or naturally.

Union by Rank is a disjoint-set optimization that attaches the shallower tree under the deeper tree.
This description distinguishes it from the other choices.