Learn How to Code using Python Day 11. Here in this post, you will learn about Heaps. 1. A heap is a tree-data structure in which the value of a parent node is ordered in a certain way with respect to the value of its child node(s). 2. A heap can be either a min heap (the value of a parent node is less than or equal to the value of its children) or a max heap (the value of a parent node is greater than or equal to the value of its children). 3. A heap is created by using python's inbuilt library named heapq. 4. We can create a heap using the heapify function. This function converts a regular list to a heap. In the resulting heap the smallest element gets pushed to the index position 0. But rest of the data elements are not necessarily sorted. 5. You can insert a data element to a
