heaps fig heap shape conceptually heap is treebut heaps are generally not stored as trees complete tree is tree that is full on all levels except the lowest level which is filled in from left to right because heaps are complete treesthey may be stored in an array an example will help in understanding heaps and the complete property better consider largest on top heap with the root node stored at index in an array conceptuallyfig is heap containing integers the data in this conceptual version is stored in an array by traversing the tree level by level starting from the root node to the heap the conceptual heap in fig would be stored in an array as organized in fig there are two properties that heap exhibits they areheap structure propertythe elements of the heap form complete ordered tree heap order propertyevery parent >all children (including all descendantsthe heap in fig maintains these two properties the array implementation of this heap in fig also maintains these properties to see how the properties are maintained in the array implementation we need to be able to compute the location fig sample heap fig heap organization this copy belongs to 'acha