A heap is a semi-ordered tree in which the parent node is larger (usually, you can reverse this) than its child nodes. This post will describe a Binary Heap in which each node has two children. The method we’ll be using is what I call a dense tree in that every ‘leaf’ on a level [...]
Source
Source