Chapter 18, Problem 8SA

Explanation of Solution

The following is the complete code for the code segment

 

//include the required header files

#include <iostream>

#include <stack>

#include <cassert>

using namespace std;

//create a structure

struct node_Type

{

  int info;

  node_Type *nxt;

};

 

//definition of a class linkedStackType

class linkedStackType

{

  //declare some basic functions of stack

public:

    linkedStackType();

    void push(int n);

    void pop();

    int top();

    bool isEmptyStack();

    void clear_Stack();

private:

    node_Type *s_Top;

};

//end of the class

 

//definition of the function linkedStackType()

linkedStackType::linkedStackType()

{  

    s_Top = NULL;

}

 

//definition of the function isEmptyStack

bool linkedStackType::isEmptyStack()

{

    return (s_Top == NULL);

}

 

//definition of the function push()

void linkedStackType::push(int item)

{

    node_Type *new_Node = new node_Type;

  new_Node->info = item;

 

  new_Node->nxt = s_Top;

  s_Top = new_Node;

}

 

//definition of the function top()

int linkedStackType::top()

{

    assert(!isEmptyStack());

  

    return s_Top->info;

}

 

//definition of the function pop()

void linkedStackType::pop()

{

    if(isEmptyStack())

        cout<<"Stack is empty" << endl;

    else

  {

        node_Type *current = s_Top;

    s_Top = s_Top->nxt;

    delete current;

  }

}

 

//definition of the function clear_Stack()

void linkedStackType::clear_Stack()

{

  while(s_Top != NULL)

  {

    node_Type *current = s_Top;

    s_Top = s_Top->nxt;

    delete current;

  }

}

 

//definition of the main function

int main() {

  linkedStackType stack;

  long long num;

  int temp;

  int secretNum = 0;

  cin >> num;//837298651020706

  num = abs(num);

  while (num > 0)

  {  

    stack...