Skew Heap Algorithm

A skew heap (or self-adjusting heap) is a heap data structure implemented as a binary tree. Every operation (add, remove_min, merge) on two skew heaps must be done use a special skew heap merge.

Skew Heap source code, pseudocode and analysis

COMING SOON!