Dsa_Hub

A heap is a binary tree-based data structure that satisfies the heap property: the value of each node is greater than or equal to the value of its children. This property makes sure that the root node contains the maximum or minimum value (depending on the type of heap), and the values decrease or increase as you move down the tree.

Types of Heaps

There are two main types of heaps:

• Max Heap: The root node contains the maximum value, and the values decrease as you move down the tree.
• Min Heap: The root node contains the minimum value, and the values increase as you move down the tree.