Heap

A min-heap is a tree stored in a list where every parent is smaller than its children. The smallest item is always at the front, and adding or removing takes only O(log n). A tree hiding in a list Check your understanding