Your assignment is to write and compare two implementations of a priority queue whose highest priority element is the one with the smallest key value. The elements have the following declarations:
- The first implementation uses a minimum heap. You need to modify the heap operations to keep the minimum, rather than maximum, element in the root. The comparison function should compare key fields.
- The second implementation uses a linear linked list, whose elements are ordered by key value.
Here is A++ solution for this question.
Using Visual Studio (C++ project) to programming.
If you have more question, please contact me via email firstname.lastname@example.org
I will help you any time
Thank you so much