Made Easy DS doubt closed

Question

IS IT CORRECT…??

 

Comments

Yes it is the most efficient as you see. What is your doubt? By the way, change the title to Made Easy DS doubt

---

@Sayan Bose how is it the most efficient. When we are implementing priority queue, why would we search any random element in it, we would always search highest or lowest priority. Insertion and deletion would be the heavy operations, for which heap is the better choice

So, heap should be answer.

---

Heap should be the answer.https://en.m.wikipedia.org/wiki/Priority_queue

---

When we are implementing priority queue, why would we search any random element in it,

while implementing you didn't require, after implementing, now, suddenly i want to change a node priority.

Then i have to first search it, right ?

---

@Vikas123

Please type the question instead of screenshot !

Moreover first check for duplicates, most of Madeeasy questions are already posted here :)

---

ok brother...