What is the best case time complexity of the binary tree sort? – McqOptions

MCQOPTIONS

1.	What is the best case time complexity of the binary tree sort?
A.	O(n)
B.	O(nlogn)
C.	O(n<sup>2</sup>)
D.	O(logn)
Answer» C. O(n<sup>2</sup>)

Discussion

No Comment Found

Related MCQs

Consider the following statements related to the binary tree sort.I. Element can be added gradually as they become available
Which of the following sorting algorithms can be considered as improvement to the binary tree sort?
Binary tree sort is an in-place sorting algorithm.
What is the best case time complexity of the binary tree sort?
What is the worst case time complexity of the binary tree sort?
In binary tree sort, we first construct the BST and then we perform _______ traversal to get the sorted order.
Consider the original array 17 8 12 4 26. How many comparisons are needed to construct the BST on the original array?