Today, we talked about how to implement the merge operation of Binomial heap in O(log n) time. This will give us insertion, delete_min, merge all in O(log n).
Surprisingly, if we are a little bit lazier in the implementation, we can make all the operations O(1) except for the delete_min operation.
No comments:
Post a Comment