Skew Heaps
Problems with leftist heaps
- extra storage for npl
- two pass merge (with stack!)
- extra complexity/logic to maintain and check npl
Solution: skew heaps
- blind adjusting version of leftist heaps
- amortized time for merge, insert, and deleteMin is O(log n)
- worst case time for all three is O(n)
- merge always switches children when fixing right path
- iterative method has only one pass