Q71
The binary tree sort implemented using a self - balancing binary search tree takes . . . . . . . . time is worst case.
A.
O(n log n)
AnswerB.
O(n)
C.
O(n2)
D.
O(log n)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board