What are the time complexities for a priority queue implemented with a heap?

2025

Answer: A. Insert : θ(log n), Remove : θ(log n)

1. A.

   Insert : θ(log n), Remove : θ(log n)

2. B.

   Insert : θ(n), Remove : θ(1)

3. C.

   Insert : θ(1), Remove : θ(log n)

4. D.

   Insert : θ(log n), Remove : θ(1)

Attempted by 476 students.