Rene Meis

Learn More
We implement and prove correct binomial heaps and skew bino-mial heaps. Both are data-structures for priority queues. While bi-nomial heaps have logarithmic findMin, deleteMin, insert, and meld operations, skew binomial heaps have constant time findMin, insert, and meld operations, and only the deleteMin-operation is logarithmic. This is achieved by using(More)