Use app×
QUIZARD
QUIZARD
JEE MAIN 2026 Crash Course
NEET 2026 Crash Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
196 views
in Information Technology by (121k points)
closed by
Which of the following is not an advantage of tree sort?

(a) it has a low space complexity

(b) it has good time complexity for balanced BST

(c) it is an online sorting algorithm

(d) it is stable sorting algorithm

1 Answer

0 votes
by (121k points)
selected by
 
Best answer
Correct answer is (a) it has a low space complexity

To explain: Tree sort has a linear time complexity O(n) which makes it inefficient. This the main reason why sorting algorithms like quick sort, heap sort etc. are preferred over it.

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...