Medium-Easy Understand Heaps & Priority Queues Multiple Choice

What is the optimal time complexity for solving the 'Heaps & Priority Queues' classic problem?

Understand — Tests comprehension and ability to explain concepts.

Answer Options

A O(1)

B O(log n)

C O(n)

D O(n log n)

Get the answer with a detailed explanation, plus practice 31+ more Heaps & Priority Queues questions with adaptive quizzes and timed interviews.

This question is from the Heaps & Priority Queues topic (Data Structures).

In a min-heap stored as an array, what is the parent index of the node at index i?

What is the time complexity of extracting the minimum from a min-heap?

What is the heap invariant for a min-heap?

What is the time complexity of peek() (see minimum without removing) in a min-heap?

Why use a min-heap of size k to find the kth LARGEST element?