Data Structures 300 Unique MCQs

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.

Splay Tree fits because it supports workloads with strong locality of reference and recently accessed elements become quicker to access again.
Both clues point to this choice.

Binary Search Tree fits because it supports ordered searching and dynamic set operations and an inorder traversal produces keys in sorted order.
Both clues point to this choice.

AVL Tree is a self-balancing binary search tree with tightly controlled subtree heights.
This description distinguishes it from the other choices.

AVL Tree is commonly used for search-intensive applications requiring predictable logarithmic height.
Its design supports this task efficiently or naturally.

The defining property is that each node's balance factor is typically -1, 0, or 1.
The other statements describe different structures or concepts.

AVL Tree fits because it supports search-intensive applications requiring predictable logarithmic height and each node's balance factor is typically -1, 0, or 1.
Both clues point to this choice.

Binary Search Tree is a binary tree where left-subtree keys are smaller and right-subtree keys are larger under a chosen ordering.
This description distinguishes it from the other choices.

Binary Search Tree is commonly used for ordered searching and dynamic set operations.
Its design supports this task efficiently or naturally.

The defining property is that an inorder traversal produces keys in sorted order.
The other statements describe different structures or concepts.