Leftist Heap Algorithm

In computer science, a leftist tree or leftist heap is a priority queue implemented with a variant of a binary heap. However merge leftist heaps has worst-case O(log n) complexity while merge skew heaps has only amortized O(log N) complexity.

Leftist Heap source code, pseudocode and analysis

COMING SOON!