Q448
What is the worst case time complexity of the binary tree sort?
A.
O(n)
B.
O(nlogn)
C.
O(n2)
AnswerD.
O(logn)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board