Removes the lowest value element (highest priority, at root) from the heap
(self)
| 63 | parent = self.parent_idx(child) |
| 64 | |
| 65 | def pop(self): |
| 66 | """ |
| 67 | Removes the lowest value element (highest priority, at root) from the heap |
| 68 | """ |
| 69 | min = super().dequeue() |
| 70 | if self.rear >= 1: # heap may need to be fixed |
| 71 | self.heapify_down() |
| 72 | return min |
| 73 | |
| 74 | def favorite(self, parent): |
| 75 | """ |