Leftist Heap

What would you like to Propose?

I would like to add a new feature to the datastructures/heaps section called the leftist heap.

Issue details

This data structure will support the normal operations of a min binary heap. The difference here is that along with maintaining the min heap properties, it must also maintain the property in which the null-path length (npl) of the left subtree is greater than or equal to the npl of the right subtree. A merge function will be a key feature of this data sctucture, where it will merge the contents of 2 leftist heaps creating a new one, while maintaining the leftist property.

Additional Information

No response