Bimomial-Heap-Delete

Bimomial-Heap-Delete (H, x)

The above procedure deletes node x's key from a given binomial heap. It uses operation ‘Binomial-Heap-Extract-Min’, and ‘Decrease-key’.
Step 1 Decreasing the key to – 
call to Decrease-key (H, x, – )
Step 2 Extracting the minimum key
call to Binomial-Heap-Extract-Min(H)