Pairing Heaps utilizes heap data structure to give efficient output with fast amortized time complexity. It is self adjusting,i.e. it can balance itself after an operation is performed.
Pairing Heap is of two types:
1- Minimium Pairing Heap.
2- Maximum Pairing Heap.
Minimum pairing heap is implemented here.
Time complexity for different operations is less in pairing heaps as compared to other heaps like Fibonacci Heap or a simple Binary Heap atcetera. Moreover, it is an efficient form of a Fibonacci Heap which makes it better from other heaps.
The operations of the minimum pairing heap are:
1- Insert( ) - It will insert a value in pairing heap.
2- Merge( ) - It will merge the roots of two pairing heaps.
3- FindMin( ) - Will return the minimum value in the Pairing heap.
4- Delete( ) - Will Delete a value by using two pass method.
5- GetSize( ) - Will return the size of pairing heap.
6- BubbleUp( ) - This is the two pass method utilized for deleting.
1- Agha Muqarib - https://github.com/AghaMuqarib-2000
2- Mansoor Ahmed - https://github.com/mansoorahmed-asterics
3- Mirza Khizer - https://github.com/mirzakhizar