Min Heap: A complete binary tree (that is filled other than the rightmost elements on the last level) where each node is smaller than its children. The root, therefore, is the minimum element in the tree. We have two key operations on a min-heap: insert and extract_min Insert When we insert into a min-heap, we always start by inserting the element at the bottom. We insert it at the rightmost spo..
