Because of the transfer of (N – 1) (log (n + N) – log N) elements to the last level d of the heaps, there is an additional cost due to the fact that these extra elements have to travel all the way to one of the roots. This cost is two comparisons and one swap for each level as stated above.