+1 vote
in Data Structures & Algorithms I by (110k points)
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(n^2)

(d) O(log n)

I'd like to ask this question from Binary Trees topic in chapter Binary Trees of Data Structures & Algorithms I

The question was posed to me at a job interview.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Correct choice is (a) O(n log n)

Best explanation: The worst case running time of the binary tree sort is O(n^2). But, the worst case running time can be improved to the O(n log n) using a self – balancing binary search tree.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.