IN CASE OF PRIORITY QUEUE OR WE CAN SAY MAX HEAP OR MIN HEAP.
.WHEN DUPLICATE ENTRIES EXIST THEN WHICH ELEMENT OUT OF TWO SAME ONE WILL GET FIRST CHANCE…
. SOME TIME IT NOT METTER MUCH BUT LET SAY YOU’R PERFORMING DIJKSTRA ALGORITHM THEN BECOME CONFUSING SOME TIME???/ ANYONE HAVE AN IDEA???
