- Courses
- Tutorials
- Practice
Data Structure
Java
Python
HTML
Interview Preparation
Data Structures | Heap | Question 1
Last Updated :
Discuss
Comments
What is the time complexity of Build Heap operation?
(Build Heap is used to build a max(or min) binary heap from a given array. Build Heap is used in Heap Sort as a first step for sorting.)
O(nLogn)
O(n^2)
O(n)
O(logn)
This question is part of this quiz :
Top MCQs on Heap Data Strcuture with AnswersTags:
Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy