Data Structures 300 Unique MCQs

Max-Heap is a heap in which every parent key is no less than its children's keys.
This description distinguishes it from the other choices.

Trie fits because it supports prefix search and autocomplete and edges typically represent characters or symbols.
Both clues point to this choice.

Radix Tree is a compressed trie that merges chains of single-child nodes.
This description distinguishes it from the other choices.

Radix Tree is commonly used for memory-efficient prefix indexing.
Its design supports this task efficiently or naturally.

The defining property is that an edge may represent a string rather than one character.
The other statements describe different structures or concepts.

Radix Tree fits because it supports memory-efficient prefix indexing and an edge may represent a string rather than one character.
Both clues point to this choice.

Heap is a complete tree-based structure satisfying a heap-order property.
This description distinguishes it from the other choices.

Heap is commonly used for priority queue implementation.
Its design supports this task efficiently or naturally.

The defining property is that only the root is guaranteed to contain the global minimum or maximum.
The other statements describe different structures or concepts.

B+ Tree is a balanced multiway index tree that stores records or record pointers at leaf level.
This description distinguishes it from the other choices.

B+ Tree is commonly used for database range queries.
Its design supports this task efficiently or naturally.

The defining property is that leaf nodes are commonly linked for sequential access.
The other statements describe different structures or concepts.