31Heap_info.c

int main(int argc, char const *argv[])
{
/* 
A Heap is a tree with some special properties.

The basic requirement of a heap is that the value of a node must be >= or <= to the values of its children..

The heap also has the additional property that all leaves should be at h or h-1 levels(where is the height of the tree) some h>0
(complete binary tree)

There are two type of heap 
Min Heap
Max Heap


 */
//Navjot Singh Prince
	return 0;
}