Heap Data Structure & Priority Queue Implementation (C++)

Developed a C++ implementation of the Heap data structure to

demonstrate efficient priority-based data management.

The project includes a custom Max Heap implementation with

support for insertion, extraction of the maximum element,

and maintaining heap properties using heapify operations.