code: public void remove(Entry entry) {
          entry.priority = null;
          cutAndMakeRoot(entry);
          oMinEntry = entry;
          poll();
      }
docs: Deletes `entry` from the heap. The heap will be consolidated, if necessary.
  Runtime: O(log n) amortized