# Let’s Build a Min Heap

A heap data structure in computer science is a special tree that satisfies the heap property, this just means that the parent is less than or equal to the child node for a minimum heap A.K.A **min heap**, and the parent is greater than or equal to the child node for a maximum heap A.K.A **max heap**. In this article I will talk specifically about binary heaps, so each node in our tree will have at most two children. Yes there are more than just binary…