What is the worst case time complexity of tree sort (when implemented with an unbalanced tree)?
(a) O(n)
(b) O(n log n)
(c) O(n^2)
(d) O(log n)
I got this question in an internship interview.
The query is from Sorting topic in section Sorting of Data Structures & Algorithms II