Given that a binomial heap is a collection of binomial trees, I am having difficulty understanding how we can efficiently print out the contents of a binomial heap in ascending/descending order (depending on if it is a min/max heap).
Currently the method I am using is creating a clone of the heap and extracting the minimum (as this is a minimum binomial heap) until all the elements have been extracted. This would result in O(n*log(n)) time if I understand it correctly, which is quite a long process.
Is there any way of speeding up this process, or some other alternative method of printing out the contents of a binomial heap in ascending order?