The process of turning a binary tree into a Heap data structure is known as Heapify. A binary tree is a data structure in the shape of a tree, in which each level is filled, except the last, and all nodes are as far left as possible from each other. A Heap should be a complete binary tree, which means that each tree level is filled, except the bottom level. It is filled from left to right at this level. A heap must also meet the heap-order property, which states that the value stored at each node is more significant than or equal to the value stored at its offspring.