Top | MCQs on Advance Data Structure with Answers | Question 23

A self-balancing binary search tree that optimizes for insertions and deletions rather than strict balance is called:

(A)

AVL tree

(B)

Red-Black tree

(C)

Splay tree

(D)

B + Tree

Answer: (C)
Explanation:

Splay tree is a self-adjusting binary search tree data structure, which means that the tree structure is adjusted dynamically based on the accessed or inserted elements. In other words, the tree automatically reorganizes itself so that frequently accessed or inserted elements become closer to the root node.

Hence Option(C) is the correct answer.

Quiz of this Question
Please comment below if you find anything wrong in the above post