Can someone help me with C++? I have to implement a priorityQueue Linked List. ////////////////////////////////////////// driver.cpp ////////////////////////////////////////// #include #include #include "stackLL.h" #include "queueLL.h" #include "priorityQueueLL.h" using namespace std; int main() {     //////////Test code for priority queue///// priorityQueueLL pQueue;     const int SIZE = 20;     //insert a bunch of random numbers     for (int i = 0; i < SIZE; i++)     {         pQueue.insert(rand());     }     //pull them back out..     //They must come out in order from smallest to largest     while (!pQueue.empty())     {         cout << pQueue.extractMin() << endl;     }     priorityQueueLL pqs;     pqs.insert("whale");     pqs.insert("snake");     pqs.insert("buffalo");     pqs.insert("elmo");     pqs.insert("fire");     pqs.insert("waffle");     //buffalo elmo fire snake waffle whale     while (!pqs.empty())     {         cout << pqs.extractMin() << endl;     }     return 0; } ////////////////////////////////////////// priorityQueueLL.h  (In the image)  //////////////////////////////////////////

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Can someone help me with C++? I have to implement a priorityQueue Linked List.

//////////////////////////////////////////

driver.cpp

//////////////////////////////////////////

#include <iostream>
#include <string>
#include "stackLL.h"
#include "queueLL.h"
#include "priorityQueueLL.h"
using namespace std;

int main()
{

    //////////Test code for priority queue/////

priorityQueueLL<int> pQueue;

    const int SIZE = 20;

    //insert a bunch of random numbers
    for (int i = 0; i < SIZE; i++)
    {
        pQueue.insert(rand());
    }

    //pull them back out..
    //They must come out in order from smallest to largest
    while (!pQueue.empty())
    {
        cout << pQueue.extractMin() << endl;
    }


    priorityQueueLL<string> pqs;

    pqs.insert("whale");
    pqs.insert("snake");
    pqs.insert("buffalo");
    pqs.insert("elmo");
    pqs.insert("fire");
    pqs.insert("waffle");

    //buffalo elmo fire snake waffle whale
    while (!pqs.empty())
    {
        cout << pqs.extractMin() << endl;
    }

    return 0;
}

//////////////////////////////////////////

priorityQueueLL.h  (In the image) 

//////////////////////////////////////////

 

template <class T>
class priorityQueueLL
{
private:
class node
{
public:
//put what you need here..
}
//add what you wish here
public:
priorityQueueLL ()
{}
rpriorityQueuelL ()
{}
//return true if empty, false if not
bool empty()
{}
//add item
void insert(T x)
{}
//remove and return smallest item
I extractMin()
{}
};
Transcribed Image Text:template <class T> class priorityQueueLL { private: class node { public: //put what you need here.. } //add what you wish here public: priorityQueueLL () {} rpriorityQueuelL () {} //return true if empty, false if not bool empty() {} //add item void insert(T x) {} //remove and return smallest item I extractMin() {} };
Expert Solution
Step 1

The solution to the given problem is below.

trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Linked List Representation
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education