C++ Motivation: You have to to implement Priority Queue, using array or a comple
ID: 3687203 • Letter: C
Question
C++
Motivation: You have to to implement Priority Queue, using array or a complete binary tree structure.
Requirements: You should name your Prority Queue class as PQ. The queue must be able to hold unlimited number of integers. It has two key operations: Push and Pop, which should have the time complexity of O(logn).
Files to turn in: You need to turn in four files: makefile, main.C, PQ.C, PQ.h. You should have a main.C that reads in or generates some integers, pushes them into the PQ one by one, and pops and prints them until the PQ is empty.
Grading: The total points is 12, you will get full credit if you correctly implement it using tree structure, 6 points if you correctly implement it using array. Your code must be compilable on Linux/Unix, any code that cannot be compiled by g++ will automatically get ZERO point.
Please provide all files
Explanation / Answer
Hi below i have written a sample code for your reference,
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.