How much time does it take to build a binomial heap of $$n$$ elements $($i$.$e$.,$ we initially have

an empty heap and then we do $$n$$ insertions$).$ The straightforward answer is O$($n log n$),$

because each insertion costs O$($log n$)$ time. But can you make this bound tighter?