Similar to binary search trees but with different set of rules.

There are two different Binary heaps

  1. Max Binary Heap which has the largest value on the root node and parent node should always be larger than child node.

2. Min Binary Heap which is the opposite of the max. The root node is the Lowest value and the parent node is always larger than the child node.