Today’s topic was Binomial Heaps. We discussed the homework for next week (I’ll make a separate post for it) and covered a bit on Binary Heaps first.
We looked at makeheap, heapify, insert, delete, findmin, and meld operations and discussed their runtime. The meld operation inspired us to move to Binomial Heaps where we can merge two Binomial heaps quickly.
We talked about bounds for these operations for Binomial Heaps as well but we didn’t prove any of them.
Next time, we will finish up these operations and hopefully move on to Fibonacci Heaps.
You can read more about today’s topic in Kozen Ch. 8.