notes figure object class hierarchy comparable abstract object abstract container container binaryheap priorityqueue mergeablepriorityqueue tree binomialqueue abstracttree binarytree leflistheap generaltree binomialtree program- introduces the binaryheap class the binaryheap class extends the abstractcontainer class introduced in program and it implements the priorityqueue interface defined in program public class binaryheap extends abstractcontainer implements priorityqueue protected comparable [array/program binaryheap fields putting items into binary heap there are two requirements which must be satisfied when an item is inserted in binary heap firstthe resulting tree must have the correct shape secondthe tree must remain heap-ordered figure illustrates the way in which this is done since the resulting tree must be complete treethere is only one place in the tree where node can be added that issince the bottom level must be filled from left to rightthe node node must be added at the next available position in the bottom level of the tree as shown in figure (afigure inserting an item into binary heap lovely professional university