Pairing heap

A pairing heap is a heap structure, which is simple to implement in functional languages, and which provides good amortized performance.

Operations

• merge - Θ(1) - Merges two heaps
• insert - Θ(1) - Inserts an element into a heap
• findMin - Θ(1) - Returns the minimal element from the heap
• deleteMin - O(log n) - Deletes the minimal element from the heap

Further information

• Wikipedia

---

<p align="center"> A massive collaborative effort by <a href="https://github.com/OpenGenus/cosmos">OpenGenus Foundation</a> </p>

---