Binomial and fibonacci heap type

[jetoso]

Suppose you have n elements with integer keys and they are to be put into a heap. What would be the time for creating a heap by repeated insertion into into an initially empty heap? Say, for instance if we are using binary, binomial and fibonacci heap type.

Any suggestions?

 

[Hurkyl]

The time it takes to insert the first element, plus the time it takes to insert the second element, plus...