http://www.geeksforgeeks.org/binomial-heap-2/
2) getMin(H): A simple way to getMin() is to traverse the list of root of
Binomial Trees and return the minimum key. This implementation requires
O(Logn) time. It can be optimized to O(1) by maintaining a pointer to minimum
key root.