Test 1 Algorithms | Computer Science

Time: 00:00:00

0

Attempted

20

Not Attempted

0

Marked For Review

0

Attempted & Reviewed

Question 1 of 20

In a heap with n elements with the smallest element at the root, the 7th smallest element can be found in time

Select Your Answer:

O(n log n)

O(n)

O(log n)

O(1)

Mark for Review

All Questions

Attempted

Not Attempted

Marked for Review

Attempted & Reviewed

Current