If n numbers are to be sorted in ascending order in O (n log n) time, which

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. Binary tree 

B. Binary search tree 

C. Max-heap 

D. Min-heap

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: