unit heaps unit heaps notes contents objectives introduction heaps binary heaps complete trees implementation putting items into binary heap removing items from binary heap applications of heaps discrete event simulation implementation -heaps summary keywords self assessment review questions further readings objectives after studying this unityou will be able todescribe heaps state the concept of binary heaps discuss applications of heaps define -heaps introduction heap is specialized tree-based data structure that satisfies the heap propertyif is child node of athen key( >key(bthis implies that an element with the greatest key is always in the root nodeand so such heap is sometimes called max-heap (alternativelyif the comparison is reversedthe smallest element is always in the root nodewhich results in min-heap the heap is one maximally-efficient implementation of an abstract data type called priority queue heaps are crucial in several efficient graph algorithms heaps heap is storage pool in which regions of memory are dynamically allocated for examplein +the space for variable is allocated essentially in one of three possible placesglobal lovely professional university