The idea (presented in [6]) takes inspiration from B-trees and allows the nodes of the heap to be incomplete. One may say that instead of having only one extract buffer for the whole heap, every node in the heap is used as an extract buffer for its descendants. The function of the insert buffer is left unchanged.