Chapter 17, Problem 6PP

Program Plan Intro

  Priority queue

Program plan:

• Define a file “Priority.h” to declare operation and functions.
  • Include the directives for header file.
  • Declare a “PriorityQueue” template class.
  • Define a template class named “Node”.
    • Inside the access specifier “public”, define a constructor of class “Node”.
    • Declare a friend class “PriorityQueue”.
  • Inside the access specifier “private”, create an object for template.
  • Declare an integer variable “priority” and create a pointer variable “*next”.
• Define a template class named “PriorityQueue”.
  • Inside the access specifier “public”, Declare a constructor of class “PriorityQueue”.
    • Declare the “add()” function to add items in the queue.
    • Declare the “remove()” function to remove items from the queue.
    • Declare the “isEmpty()” Boolean function to return the status of queue.
• Define a file “main().cpp” to call functions from “Priority.h” and perform all computations.
• Define a constructor of class “PriorityQueue()” to assign “null” to “head” of the queue.
• Define “add()” function to add new node onto the front of the queue.
• Define “remove()” function to remove the smallest priority from the queue.
• Define “isEmpty()” function to return “true” or “false” if the queue is empty.
• Define a “main()” function.
  • Create an object for class “PriorityQueue”.
  • Add and remove some items in the queue and print the result.