Test 1 Algorithms | Computer Science
Casual Mode - Take your time!
1 / 20
Correct
0
Incorrect
0
Score
0%
Multiple Choice
In a heap with n elements with the smallest element at the root, the 7th smallest element can be found in time
- O(n log n)
- O(n)
- O(log n)
- O(1)