Heap implementation using C++

Inspiration

Implement a data structure

What it does

• insert (log n)
• deleteMax(log n)
• findMax(1)
• print out the heap structure
• stores k integers in one node in incresing order
• maintains the heap structure: parents have larger value than children

How we built it

• using C++
• using vector as the base data structure

Built With

• c++