Vidyalelo
Data Structure · Q96

Heaps

Programming · Data Structure · question 96

Q96

Descending priority queue can be implemented using . . . . . . . .

A.
max heap
Answer
B.
min heap
C.
min-max heap
D.
trie

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board