Question

Please answer in C++

Derive a class called Queue from the linked list described in Assignment 2 (list of Dates). This means the Queue class will inherit all the properties (data and functions) of the linked list. But, since a queue allows pushing only at the back and popping at the front of the list, you will need to prevent the addition in the front and removal at the back. To do this, you must derive the Queue class in such a way that the base class (LinkedList) functions become private in the derived class (Queue). See private and protected inheritance, instead of public inheritance. Then, define Stack's own add and remove functions that call the appropriate functions for adding and removing from the Queue.

Write a main program, where you present a menu to the user and allow adding Dates (as described in Assignment 2), removing Dates, searching for a Date, displaying all Dates and quit. Keep presenting the menu until quit is selected.

The referred Assignment 2 code is below, so you can use the code and modify it based on the instructions above. Thank you!

#include <iostream>
#include "List.h"

int main() {
List LinkedList;

char input='y';
while(input=='y' || input=='Y'){
cout << "Hello User, Choose from the Below options:" << endl;
cout << "1. Print List" << endl;
cout << "2. Push to List" << endl;
cout << "3. Pop from List" << endl;
int choice;
std::cin >> choice;
if(choice == 1){
cout << "List: ";
LinkedList.print();
cout << endl;
}
else if (choice == 2) {
struct time t;
cout << "Input date in format dd/mm/yy:";
scanf("%d/%d/%d",&(t.date),&(t.month),&(t.year));
LinkedList.push(t);
}
else if (choice == 3){
struct time t=LinkedList.pop();
printf("%d/%d/%d was popped from list",t.date,t.month,t.year);
LinkedList.print();
cout << endl;
}
}
system("pause");
return 0;
}

struct time{
int date,month,year;
};

class List {
private:
class Node {
private:
Node* m_Next;
struct time m_data;
public:
Node(void):m_data(0), m_Next(0) {}
Node(struct time data):m_data(data), m_Next(0) {}

Node* getNext(void) {
return m_Next;
}
struct time getData(void) {
return m_data;
}

void setNext(Node* node) {
m_Next = node;
}
void setData(int data) {
m_data = data;
}
};

Node* m_Head;
int m_count;

public:
List(void):m_Head(0), m_count(0) {}

  
void print(void) {
Node* navigator = m_Head;
while (navigator != 0) {
struct time t = naviagtor->getData();
printf("%d/%d/%d\n",t.date,t.month,t.year);
navigator = navigator->getNext();
}
}

  
struct time pop(void) {
Node* temp = m_Head;
m_Head = m_Head->getNext();
m_count--;
return temp->getData();
}

void push(struct time data) {
Node* node = new Node(data);
Node* temp = m_Head;
m_Head = node;
m_Head->setNext(temp);
m_count++;
}

struct time getCount(void) {
return m_count;
}

};

Answer 1

#include<iostream>

using namespace std;

struct Node{
int data;
Node *next;
};

class Queue{
    public:
Node *front,*rear;
Queue(){front=rear=NULL;}

void insert(int n);
void deleteitem();
void display();
~Queue();
};

void Queue::insert(int n){
Node *temp=new Node;
if(temp==NULL){
cout<<"Overflow"<<endl;
return;
}
temp->data=n;
temp->next=NULL;

//for first node
if(front==NULL){
front=rear=temp;
}
else{
rear->next=temp;
rear=temp;
}
cout<<n<<" has been inserted successfully."<<endl;
}

void Queue::display(){
if(front==NULL){
cout<<"Underflow."<<endl;
return;
}
Node *temp=front;
//will check until NULL is not found
while(temp){
cout<<temp->data<<" ";
temp=temp->next;
}
cout<<endl;
}

void Queue :: deleteitem()
{
if (front==NULL){
cout<<"underflow"<<endl;
return;
}

cout<<front->data<<" is being deleted "<<endl;
if(front==rear)//if only one node is there
front=rear=NULL;
else
front=front->next;
}

Queue ::~Queue()
{
while(front!=NULL)
{
Node *temp=front;
front=front->next;
delete temp;
}
rear=NULL;
}


int main(){
Queue Q;
Q.display();

Q.insert(10);
Q.insert(24);
Q.insert(28);
Q.insert(32);
Q.insert(30);

Q.display();

Q.deleteitem();
Q.deleteitem();
Q.deleteitem();
Q.deleteitem();
Q.deleteitem();

return 0;
}