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