Question: If n numbers are to be sorted in ascending order in O (n log n) time, which of the following tree can be used A.
If n numbers are to be sorted in ascending order in O (n log n) time, which of the following tree can be used
A. Binary tree
B. Binary search tree
C. Max-heap
D. Min-heap
Step by Step Solution
3.35 Rating (155 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
