Q303
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(n2)
AnswerD.
O(log n)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board