Performance
All of the following operations work in O(log n) time on a binomial heap with n elements:
- Insert a new element to the heap
- Find the element with minimum key
- Delete the element with minimum key from the heap
- Decrease key of a given element
- Delete given element from the heap
- Merge two given heaps to one heap
Finding the element with minimum key can also be done in O(1) by using an additional pointer to the minimum.
Applications
- Discrete event simulation(http://en.wikipedia.org/wiki/Discrete_event_simulation?temp-new-window-replacement=true)
- Priority queues( http://en.wikipedia.org/wiki/Priority_queue?temp-new-window-replacement=true)
For looking and observing all the
operations practically,you can use this
applet.
