Data Structures MCQs

The defining property is that edges typically represent characters or symbols.
The other statements describe different structures or concepts.

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.

B-Tree fits because it supports database and file-system indexes and a node can store multiple keys and have multiple children.
Both clues point to this choice.

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 and file-system indexes.
Its design supports this task efficiently or naturally.

The defining property is that a node can store multiple keys and have multiple children.
The other statements describe different structures or concepts.

The defining property is that its rules guarantee logarithmic height without strict AVL-style balance.
The other statements describe different structures or concepts.

Red-Black Tree fits because it supports implementing ordered maps and sets and its rules guarantee logarithmic height without strict AVL-style balance.
Both clues point to this choice.

Splay Tree is a self-adjusting binary search tree that moves accessed nodes toward the root.
This description distinguishes it from the other choices.

Splay Tree is commonly used for workloads with strong locality of reference.
Its design supports this task efficiently or naturally.

The defining property is that recently accessed elements become quicker to access again.
The other statements describe different structures or concepts.