**Union(H1, H2)**- Creates and returns a new heap containing all nodes
from heaps H1 and H2

**Binary Heaps:**- Union = worst case
**Binomial Heaps:**- Union = worst case
**Fibonacci Heaps:**- Union = amortized

Other operations:

Binary Heap | Binomial Heap | Fibonacci Heap | |

(worst case) | (worst case) | (amortized) | |

Make-Heap | |||

Minimum | |||

Extract-Min | |||

(Union) | |||

Decrease-Key | |||

Delete | |||

Insert |

Extract-Min maintains partial ordering over keys.

This is useful for many graph algorithms.