Data Structures MCQs

Skip List is a layered linked structure with probabilistic shortcuts.
This description distinguishes it from the other choices.

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

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

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

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

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 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.

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

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

Path Compression is an optimization that makes nodes on a find path point closer to the set representative.
This description distinguishes it from the other choices.

Path Compression is commonly used for accelerating repeated disjoint-set queries.
Its design supports this task efficiently or naturally.

The defining property is that it flattens the parent structure over time.
The other statements describe different structures or concepts.