Basic Operations on Min Heap
Following are the basic operations that are performed on the min heap:
- extractMax(): To get the maximum value and remove it from the heap.
- insert(): insert a new item in the heap.
C Program to Implement Max Heap
In this article, we will learn the implementation of the max heap in the C programming language.
A heap is a data structure like a tree with some special properties. The basic requirement of the heap is that the value of a node must be greater than equal to (or smaller than equal to) the value of its children and the tree should be a complete binary tree.
Contact Us