I will try to describe precisely and with examples what "Heap" is in theory and in practice. In the introduction, we can say that the heap is a kind of data structure representing a particular type of tree. The heap is also an extremely effective implementation of an abstract type of data called priority queue. Now let us explain exactly what has been written above.