Question

// Header code for stack // requesting to create source code using C++

#ifndef Stack_h

#define Stack_h

#include <stdio.h>

#include <string>

#include <iostream>

using namespace std;

class Stack

{

public:

Stack();

~Stack();

bool empty();

string top();

void push(const string &val);

void pop();

void display(ostream &out);

private:

class Node

{

public:

string word;

Node *next;

};

Node *tos;

};

#endif

Header file provided above. PLS create source code for functions declared in the header. If changes are need no make in the header file, pls provide the code. For this project, it has to be linked list method using pointers, not array method stack. Please provide codes clearly.

Stack::Stack()

{

//create a constructor according to header file

}

Stack::~Stack()

{

//create a destructor according to header file

}

bool empty()

{

//Check if the stack is empty using Linked list method with pointers (!!not array type)

}

string top()

{

//Read the top of the stack // use pointers

}

void push(const string &val)

{

//store the data into top of the stack // use pointers //Linked list method // Not array

}

void pop()

{

//Remove or pop the data from the top of the stack and point to the next data stored in the stack //point to NULL if nothing left   

}

void display(ostream &out)

{

// print everything stored in the stack

}

Answer 1

Stack.h

#ifndef Stack_h

#define Stack_h

#include <stdio.h>

#include <string>

#include <iostream>

using namespace std;

class Stack

{

public:

Stack();

~Stack();

bool empty();

string top();

void push(const string &val);

void pop();

void display(ostream &out);

private:

class Node

{

public:

string word;

Node *next;

};

Node *tos;

};

#endif

==================================================================
Stack.cpp

#include "Stack.h"

Stack::Stack()

{

//create a constructor according to header file

tos = NULL;

}

Stack::~Stack()

{

//create a destructor according to header file

delete tos;

}

bool Stack::empty()

{

return tos==NULL;

}

string Stack::top()

{

return tos->word;

}

void Stack::push(const string &val)

{

Node* temp;

temp = new Node();

temp->word = val;

temp->next = tos;

tos = temp;

}

void Stack::pop()

{

Node* temp;

if (tos == NULL)

cout << "The stack is Empty" << endl;

else {

temp = tos;

cout << "Element has been Popped " << temp->word << endl;

tos = tos->next;

}

}

void Stack::display(ostream &out)

{

Node* pointer;

pointer = tos;

if (tos == NULL)

return;

else {

while (pointer != NULL) {

cout << pointer->word << endl;

pointer = pointer->next;

}

}

}

=======================================================================
#include <iostream>

#include <cstdlib>

using namespace std;

#include "Stack.h"

int main() {

int pick;

Stack bar;

string object;

while (1) {

cout << "Press #1. Push" << endl;

cout << "Press #2. Pop" << endl;

cout << "Press #3. Elements" << endl;

cout << "Press #4. Exit" << endl;

cout << "Enter an option";

cout << " \n " << endl;

cin >> pick;

switch (pick) {

case 1:

cout << "Enter value to be pushed into the stack: ";

cin >> object;

bar.push(object);

break;

case 2:

bar.pop();

break;

case 3:

bar.display(std::cout);

break;

case 4:

exit(0);

break;

default:

cout << "Invalid Option" << endl;

}

}

return 0;

}

======================================================================
See OUTPUT


Thanks, PLEASE COMMENT if there is any concern.