Vidyalelo
Data Structure · Q431

Sorting Algorithms

Programming · Data Structure · question 431

Q431

In which of the following case does a tree sort become adaptive?

A.
when implemented with an unbalanced tree
B.
when implemented with a balanced tree
C.
when implemented with a splay tree as BST
Answer
D.
when implemented with AVL tree as BST

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board