posted 16 years ago
In the priority queue,
i dont understand these two methods....
they are the opposite of what should be done,, i think they give the maximum but in the data structures book it says the following
to remove the minimum:
and the other method is to peek on the minimum in the PRIORITY QUEUE:
this way, its gonna peek on the maximum --------> this is what i think
but the right thing is that it peeks on the minimum without changing anything this is from the book and my lectures so its correct but i just dont get it soo please help???
What Doesn't Kill You, Makes You Stronger!