MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
What is the best case complexity in building a heap? |
| A. | O(nlogn) |
| B. | O(n<sup>2</sup>) |
| C. | O(n*longn *logn) |
| D. | O(n) |
| Answer» E. | |