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
(d) when implemented with AVL tree as BST
I have been asked this question in examination.
The origin of the question is Sorting topic in chapter Sorting of Data Structures & Algorithms II