Implementation of Priority Queue ADT as a static library based on Heap data structure. Automatically adaptive to Heap type, supports both of removeMin() & removedMax() functions to be called at any time.
This software is licensed under a Creative Commons Attribution 4.0 International License.