The number of the levels of each heap is d = (log (n+N) – log N) because the structure could be viewed as one heap where the elements of its first log N levels have been transferred to the last one. Their addition to the last level increases the size of the heap which is now given by log (n+N) but by omitting these elements from the first levels, the depth of the heap is decreased by log N.