A min heap is a complete binary tree, in which all levels are completely filled and all the nodes in the last level are as left as possible. In a min heap, the parent’s key is smaller than both children’s keys.