Which of the following is not true about tree sort?
(a) it is not an in place sorting algorithm
(b) its every implementation is adaptive
(c) it requires in order traversal of BST for sorting input elements
(d) it is a stable sort
I got this question in an interview.
Origin of the question is Sorting topic in section Sorting of Data Structures & Algorithms II