Question

Please answer in C++.

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

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

// List.h

#include <iostream>

using namespace std;

struct time{

int date,month,year;

};

class List {

private:

class Node {

private:

               struct time m_data;

               Node* m_Next;

public:

Node(void): m_Next(0) {

               m_data.date = 0;

               m_data.month = 0;

               m_data.year = 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(struct time 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 = navigator->getData();

cout<<t.date<<"/"<<t.month<<"/"<<t.year<<endl;

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++;

}

int getCount(void) {

               return m_count;

}

};

class Stack: protected List

{

public:

               void push(struct time data);

               struct time pop();

               void print();

};

void Stack::push(struct time data)

{

               List::push(data);

}

struct time Stack::pop()

{

               return List::pop();

}

void Stack::print()

{

               List::print();

}

//end of List.h

// main.cpp

#include <iostream>

#include "List.h"

using namespace std;

int main() {

               Stack stack;

               int choice= 1;

               char ch;

               while(choice!=4){

               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;

               cout<<"4. Quit"<<endl;

               std::cin >> choice;

               if(choice == 1){

               cout << "Stack: "<<endl;;

               stack.print();

               cout << endl;

               }

               else if (choice == 2) {

               struct time t;

               cout << "Input date in format dd/mm/yy:";

               cin>>t.date>>ch>>t.month>>ch>>t.year;

               stack.push(t);

               }

               else if (choice == 3){

               struct time t=stack.pop();

               cout<<t.date<<"/"<<t.month<<"/"<<t.year<<" was popped from list"<<endl;

               //LinkedList.print();

               cout << endl;

               }else if(choice != 4)

                              cout<<"Invalid choice"<<endl;

               }

               system("pause");

               return 0;

}

//end of main.cpp

Output: