## Operations on Binomial Heap – Extract-min

May 24

In Extract-Min operation node with minimum key is deleted from the binomial heap h.The running time to extract minimum value is O(log n).The steps followed are : Find the root (say x) with minimum key. Delete the root. Break the binomial heap into h and h’. Perform the union operation to h and h’. Given the… read more »