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.(adsbygoogle = window.adsbygoogle || []).push({});

Any suggestions?

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Binomial and fibonacci heap type

**Physics Forums | Science Articles, Homework Help, Discussion**