How Heap tree is created either Max or Min using One by one key insertion or Heapify method. First increase the heap size by 1, so that it can store the new element. Insert the new element at the end of the Heap. This newly inserted element may distort the properties of Heap for its parents. So, in order to keep the properties of Heap, Heapify this newly inserted element following a bottom-up approach. 0:00 - Insertion in Heap tree 7:37 - Analysis