The binary tree sort implemented using a self – balancing binary search tree takes ______ time is worst case.
A. O(n log n)
B. O(n)
C. O(n2)
D. O(log n)
Answer:A
The binary tree sort implemented using a self – balancing binary search tree takes ______ time is worst case.
A. O(n log n) B. O(n) C. O(n2) D. O(log n)