Indicate the time efficiency classes of the three main opera

Indicate the time efficiency classes of the three main operations of the priority queue implemented as:
a. an unsorted array.
b. a sorted array.

c. a binary search tree.

d. an AVL tree.
e. a heap.

Solution

The operarations of the priority queue implemented as a heap is a time effecient

Option e is correct coiccoice.