Binomial Heap 

#techlearners
Introduction to binomial Heap and operations on binomial heap.
Binomial Heap is a collection of binomial trees
that satisfies the following properties
No two binomial trees in the collection have the same size
Each node in the collection has a key
Each binomial tree in the collection satisfies the heap order property
Roots of the binomial trees are connected and are in increasing order
or
A binomial heap H is a set of binomial trees
that satisfies the following binomial-heap
properties.
1. Each binomial tree in H obeys the min-heap property: the key of a node is greater than or equal to the key of its parent. We say that each such tree is min-heap-ordered.
2. For any nonnegative integer k, there is at most one binomial tree in H whose root has degree k.
Operations on Binomial Heap
Creation
Finding Minimum Key
Union
Insertion
Removal of the root of a tree
Decrease Key
Deletion
TECHLEARNERS BY NEERAJ SAXENA
www.techlearners.co.in