/libpq-priorityqueue-double-ended

Implementation of Double Ended Priority Queue ADT as a static library based on Binary Heap data structure. Automatically adaptive to Current Heap Orientation (MIN or MAX Heap), supports both of the removeMin() & removedMax() functions to be called at any time and in any order.

Primary LanguageCOtherNOASSERTION

Priority-Queue-ADT

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.

License

Creative Commons License
This software is licensed under a Creative Commons Attribution 4.0 International License.