additionallya heap is "complete tree- complete tree is one in which there are no gaps between leaves notes for instancea tree with root node that has only one child must have its child as the left node more preciselya complete tree is one that has every level filled in before adding node to the next leveland one that has the nodes in given level filled in from left to rightwith no breaks keywords binary heapa binary heap is heap-ordered binary tree which has very special shape called complete tree discrete event simulationone of the most important applications of priority queues is in discrete event simulation -heapd-heap is priority queue data structurea generalization of the binary heap in which the nodes have children instead of heapa heap is specialized tree-based data structure that satisfies the heap propertyif is child node of athen key( >key( self assessment fill in the blanks heap is partially sorted complete trees and perfect trees are in heap the is found at the root the method removes from priority queue the item having the smallest key the of an event depends on the type of that event the minimum priority item in min-heap may always be found at of the array the heap is one maximally-efficient implementation of an abstract data type called calculations are used to find the parent and the children of given node in the tree review questions what do you mean by heaps explain complete binary tree prove that " complete binary tree of height > contains at least and at most + nodes prove that "the internal path length of binary tree with nodes is at least as big as the internal path length of complete binary tree with nodes explain the implementation of binary heap describe how will you put items into binary heaps lovely professional university