san-santra / heap

Tree implementation of binary heap(priority queue)

#Tree implementation of priority queue

I tried to implement priority queue using heap. This one implements min heap and data is stored in tree structure.

Things to do:

• add insert()