Binary heap

(sometimes also used to determine the heap) (called binary heap) - created as a heap binary tree. Binary heap mound must be complete, a binary heap can easily be stored in me mory. Typically, it is recorded in the array. Note that each succ essive level of the mound and contains 2i vertices, except that the final n, which may have from 1 to 2n vertices. Italics in the figure recorded in the array indexes. Root mound is located in a binary array at index 1, its children are the indices 2 and 3