it create and display BST ,MIN HEAP TREE ,MAX HEAP TREE

Advance Data Structure Studies

1. A function Insert(int d) in class IntervalHeap that inserts data element d in the interval heap. 2. Similarly given the implementation of update, delete and display member functions for the interval heap class.

project on managing different pizza orders based on MinHeap data structure

Static implementation of a minHeap using Java

minheap/maxheap for C

Implementation of Compression Huffman Algorithm in C++

This program reads information about jobs from two .txt files and assign jobs to the resources with using node based minheap structure.