Aptitude
Reasoning
Verbal
Technical
AI
Exams
Search
Technical
/
Data Structures
/
Exercises
/
Exercise 3
Data Structures
medium
0/15 answered
Q1
What is the time complexity of building a heap from an array of n elements?
A
O(n)
B
O(n log n)
C
O(n^2)
D
O(log n)
← Prev
1 / 15
Next →
← Exercise 2
Exercise 3 of 7
Exercise 4 →