Operations on Leftist Heaps
merge with two trees of total size n: O(log n)
insert with heap size n: O(log n)
- pretend node is a size 1 leftist heap
- insert by merging original heap with one node heap
-
deleteMin with heap size n: O(log n)
- remove and return root
- merge left and right subtrees