Consider the following statements related to the binary tree sort.
I. Element can be added gradually as they become available
II. It needs extra memory space
A. Statement I is true but Statement II is false
B. Both Statement I and Statement II are false
C. Both Statement I and Statement II are true
D. Statement II is true but Statement I is false
Answer: Option C
This Question Belongs to Data Structure >> Sorting Algorithms
Related Questions on Sorting Algorithms
What is the time complexity of Bubble Sort in the average case?
A. O(n log n)
B. O(n)
C. O(n2)
D. O(n3)
Which sorting algorithm is based on the divide-and-conquer strategy?
A. Insertion Sort
B. Quick Sort
C. Selection Sort
D. Insertion Sort
Which sorting algorithm uses a "pivot" element to partition the array into sub-arrays?
A. Merge Sort
B. Heap Sort
C. Counting Sort
D. Quick Sort
Join The Discussion