   priority queue using heap (reheapdown)
  so I'm at school and trying to implement my reheapDown function when the item with highest priority has been dequeued, but I really don't know how the function works. I have used google but I can't find anything usefulll :(   