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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Data Structures and Other Objects Using Java Questions!