A binary heap is a heap where each node may have up to two children. Although other heaps are possible, a binary heap has the advantage of efficient implementation. This is because shift operations can be used in place of multiplication and division for a binary heap.